A Fixed-Parameter Approach to 2-Layer Planarization

Abstract A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2-Layer Planarization problem: Can k edges be deleted from a given graph G so that the remaining graph is biplanar? This problem is NP-complete, and remains so if the permutation of the vertices in one layer is fixed (the 1-Layer Planarization problem). We prove that these problems are fixed-parameter tractable by giving linear-time algorithms for their solution (for fixed k). In particular, we solve the 2-Layer Planarization problem in O(k · 6k + |G|) time and the 1-Layer Planarization problem in O(3k · |G|) time. We also show that there are polynomial-time constant-approximation algorithms for both problems.

[1]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

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

[3]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[4]  Michael Kaufmann,et al.  Fixed Parameter Algorithms for one-sided crossing minimization Revisited , 2003, Graph Drawing.

[5]  Brendan D. McKay,et al.  On an edge crossing problem , 1986 .

[6]  Akihiro Sugimoto,et al.  An Approximation Algorithm for the Two-Layered Graph Drawing Problem , 1999, COCOON.

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

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

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

[10]  Petra Mutzel,et al.  An Alternative Method to Crossing Minimization on Hierarchical Graphs , 1996, GD.

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

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

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

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

[15]  Farhad Shahrokhi,et al.  On Bipartite Drawings and the Linear Arrangement Problem , 2001, SIAM J. Comput..

[16]  Petra Mutzel,et al.  Two-Layer Planarization in Graph Drawing , 1998, ISAAC.

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

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

[19]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

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

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

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

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

[24]  Camil Demetrescu,et al.  Breaking cycles for minimizing crossings , 2001, JEAL.

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