Crossing minimization in extended level drawings of graphs
- 6 February 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (3) , 159-179
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Approximating Crossing Minimization in Radial Layouts2008
- Multi-circular Layout of Micro/Macro Graphs2008
- An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered DrawingsDiscrete & Computational Geometry, 2005
- Radial Level Planarity Testing and Embedding in Linear TimeJournal of Graph Algorithms and Applications, 2005
- Crossing Reduction in Circular LayoutsLecture Notes in Computer Science, 2004
- Communicating centrality in policy network drawingsIEEE Transactions on Visualization and Computer Graphics, 2003
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic AlgorithmsJournal of Graph Algorithms and Applications, 1997
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphsEuropean Journal of Operational Research, 1996
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- Visualization of structural information: automatic drawing of compound digraphsIEEE Transactions on Systems, Man, and Cybernetics, 1991