A polyhedral approach to the multi-layer crossing minimization problem
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An alternative method to crossing minimization on hierarchical graphsPublished by Springer Nature ,1997
- Directed graphs drawing by Clan-based decompositionPublished by Springer Nature ,1996
- Crossing numbers of graphs, lower bound techniques and algorithms: A surveyPublished by Springer Nature ,1995
- Dependency analysis in constraint negotiationIEEE Transactions on Systems, Man, and Cybernetics, 1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- Facets of the linear ordering polytopeMathematical Programming, 1985
- Crossing Number is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1983
- Methods for Visual Understanding of Hierarchical System StructuresIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Determinants, Permanents and Bipartite GraphsMathematics Magazine, 1969