Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Layered Drawings of Graphs with Crossing Constraints
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
GD '95 Proceedings of the Symposium on Graph Drawing
Graph Layout for Displaying Data Structures
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Applying Crossing Reduction Strategies to Layered Compound Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Breaking cycles for minimizing crossings
Journal of Experimental Algorithmics (JEA)
Visualization aided performance tuning of irregular task-parallel computations
Information Visualization
Ranking and drawing in subexponential time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Improved layout for data flow diagrams with port constraints
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Drawing layered graphs with port constraints
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
The one-sided two-level crossing reduction problem is an important problem in hierarchical graph drawing. Because of its NP-hardness there are many heuristics, such as the well-known barycenter and median heuristics. We consider the constrained one-sided two-level crossing reduction problem, where the relative position of certain vertex pairs on the second level is fixed. Based on the barycenter heuristic, we present a new algorithm that runs in quadratic time and generates fewer crossings than existing simple extensions. It is significantly faster than an advanced algorithm by Schreiber [12] and Finnocchi [1,2,6], while it compares well in terms of crossing number. It is also easy to implement.