An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
- 8 November 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 118-129
- https://doi.org/10.1007/3-540-36151-0_12
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Parameterized ComplexityPublished by Springer Nature ,1999
- 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
- The assignment heuristic for crossing reductionIEEE Transactions on Systems, Man, and Cybernetics, 1995
- Drawing graphs in two layersTheoretical Computer Science, 1994
- Edge crossings in drawings of bipartite graphsAlgorithmica, 1994
- 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
- Automatic Display of Hierarchized Graphs for Computer-Aided Decision AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1980
- Crossing Theory and Hierarchy MappingIEEE Transactions on Systems, Man, and Cybernetics, 1977