An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

Abstract We give an O(φk · n2) fixed parameter tractable algorithm for the 1-Sided Crossing Minimization. The constant φ in the running time is the golden ratio φ = (1+√5)/2 ≈ 1.618. The constant k is the parameter of the problem: the number of allowed edge crossings.

[1]  Matthew Suderman,et al.  Experiments with the Fixed-Parameter Approach for Two-Layer Planarization , 2003, J. Graph Algorithms Appl..

[2]  Peter Eades,et al.  Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..

[3]  Hiroshi Nagamochi,et al.  An Improved Approximation to the One-Sided Bilayer Drawing , 2003, GD.

[4]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  S. Dresbach.  A New Heuristic Layout Algorithm for Directed Acyclic Graphs , 1994 .

[6]  Martin Grohe,et al.  Computing crossing numbers in quadratic time , 2000, STOC '01.

[7]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[8]  Camil Demetrescu,et al.  Break the "Right" Cycles and Get the "Best" Drawing , 2000 .

[9]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[10]  Marie-Jose Carpano,et al.  Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Tiziana Catarci,et al.  The assignment heuristic for crossing reduction , 1995, IEEE Trans. Syst. Man Cybern..

[12]  R. Martí,et al.  A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs , 1996 .

[13]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, ESA.

[14]  Giuseppe Liotta,et al.  A Fixed-Parameter Approach to 2-Layer Planarization , 2001, Algorithmica.

[15]  Giuseppe Liotta,et al.  A Fixed-Parameter Approach to Two-Layer Planarization , 2001, Graph Drawing.

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[17]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  Stefan Dresbach.  A New Heuristic Layout Algorithm for DAGs , 1995 .

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[20]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

[21]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[22]  Imrich Vrto,et al.  One Sided Crossing Minimization Is NP-Hard for Sparse Graphs , 2001, GD.

[23]  Stefan Felsner,et al.  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..

[24]  Vida Dujmovic,et al.  An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization , 2002, Graph Drawing.

[25]  Jerrold R. Griggs,et al.  Interval graphs and maps of DNA. , 1986, Bulletin of mathematical biology.