Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing graph drawings. We report on experiments which focus on the creation and ...

In this paper, we present seven novel Max-Flow Min-Cut (MFMC) based algorithms that solve the flow routing problem in the Software Defined Network Controller. Our algorithms identify potential traffic ...