Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

We study a crossing minimization problem of drawing a bipartite graph with a radial drawing of two orbits. Radial drawings are one of well-known drawing conventions in social network analysis and visualization, in particular, displaying centrality indices of actors (Wasserman and Faust, Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, 1994). The main problem in this paper is called the one-sided radial crossing minimization, if the positions of vertices in the outer orbit are fixed. The problem is known to be NP-hard (Bachmaier, IEEE Trans. Vis. Comput. Graph. 13, 583–594, 2007), and a number of heuristics are available (Bachmaier, IEEE Trans. Vis. Comput. Graph. 13, 583–594, 2007). However, there is no approximation algorithm for the crossing minimization problem in radial drawings. We present the first polynomial time constant-factor approximation algorithm for the one-sided radial crossing minimization problem.

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

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

[3]  Hiroshi Nagamochi,et al.  An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings , 2005, Discret. Comput. Geom..

[4]  Christian Bachmaier,et al.  A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information , 2007, IEEE Transactions on Visualization and Computer Graphics.

[5]  Kozo Sugiyama.  Graph Drawing and Applications for Software and Knowledge Engineers , 2002, Series on Software Engineering and Knowledge Engineering.

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

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

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

[9]  Md. Saidur Rahman,et al.  Planar Graph Drawing , 2004, Lecture Notes Series on Computing.

[10]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

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

[12]  Emilio Di Giacomo,et al.  Drawing Bipartite Graphs on Two Parallel Convex Curves , 2008, J. Graph Algorithms Appl..

[13]  Hiroshi Nagamochi,et al.  Counting edge crossings in a 2-layered drawing , 2004, Inf. Process. Lett..

[14]  Michael Kaufmann,et al.  Fixed parameter algorithms for one-sided crossing minimization revisited , 2003, J. Discrete Algorithms.

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

[16]  Christoph Buchheim,et al.  A New Exact Algorithm for the Two-Sided Crossing Minimization Problem , 2007, COCOA.

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

[18]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

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