Cited By
View all- Evers MLinsen L(2024)2D Embeddings of Multi-Dimensional PartitioningsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345639431:1(218-228)Online publication date: 11-Sep-2024
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Pages 41 - 56
Abstract
We present a thorough experimental evaluation of several crossing minimization heuristics that are based on the construction and iterative improvement of a planarization, i.e., a planar representation of a graph with crossings replaced by dummy vertices. The evaluated heuristics include variations and combinations of the well-known planarization method, the recently implemented star reinsertion method, and a new approach proposed herein: the mixed insertion method. Our experiments reveal the importance of several implementation details such as the detection of non-simple crossings (i.e., crossings between adjacent edges or multiple crossings between the same two edges). The most notable finding, however, is that the insertion of stars in a fixed embedding setting is not only significantly faster than the insertion of edges in a variable embedding setting, but also leads to solutions of higher quality.
References
[1]
Batini C, Talamo M, and Tamassia R Computer aided layout of entity relationship diagrams J. Syst. Softw. 1984 4 2–3 163-173
[2]
Battista GD et al. Drawing directed acyclic graphs: an experimental study Int. J. Comput. Geom. Appl. 2000 10 6 623-648
[3]
Battista GD, Garg A, Liotta G, Tamassia R, Tassinari E, and Vargiu F An experimental comparison of four graph drawing algorithms Comput. Geom. 1997 7 303-325
[4]
Brglez, F., Bryan, D., Kozminski, K.: Notes on the ISCAS 1989 benchmark circuits. North-Carolina State University, Technical report, October 1989
[5]
Brglez, F., Fujiwara, H.: A neutral netlist of 10 combinational circuits and a targeted translator in FORTRAN. In: Proceedings of the ISCAS; Special Session on ATPG and Fault Simulation, pp. 151–158, June 1985
[6]
Buchheim C et al. A branch-and-cut approach to the crossing number problem Discrete Optim. 2008 5 2 373-388
[7]
Cabello S and Mohar B Crossing number and weighted crossing number of near-planar graphs Algorithmica 2011 60 3 484-504
[8]
Chalermsook P and Schmid A Poon S-H, Rahman MS, and Yen H-C Finding triangles for maximum planar subgraphs WALCOM: Algorithms and Computation 2017 Cham Springer 373-384
[9]
Chimani M and Gutwenger C Non-planar core reduction of graphs Discrete Math. 2009 309 7 1838-1855
[10]
Chimani M and Gutwenger C Advances in the planarization method: effective multiple edge insertions J. Graph Algorithms Appl. 2012 16 3 729-757
[11]
Chimani, M., Gutwenger, C., Jünger, M., Klau, G.W., Klein, K., Mutzel, P.: The Open Graph Drawing Framework (OGDF). In: Handbook on Graph Drawing and Visualization, pp. 543–569. Chapman and Hall/CRC (2013)
[12]
Chimani M, Gutwenger C, and Mutzel P Experiments on exact crossing minimization using column generation ACM J. Exp. Algorithmics 2009 14 3-4
[13]
Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: Proceedings of the SODA 2009, pp. 375–383. SIAM (2009). http://dl.acm.org/citation.cfm?id=1496770.1496812
[14]
Chimani M and Hliněný P A tighter insertion-based approximation of the crossing number J. Comb. Optim. 2016 33 4 1183-1225
[15]
Chimani, M., Ilsen, M., Wiedera, T.: Star-struck by fixed embeddings: Modern crossing number heuristics (2021). https://arxiv.org/abs/2108.11443, extended version of this paper including appendix: arXiv:2108.11443 [cs.DM]
[16]
Chimani M, Mutzel P, and Bomze I Halperin D and Mehlhorn K A new approach to exact crossing minimization Algorithms - ESA 2008 2008 Heidelberg Springer 284-296
[17]
Chimani, M., Wiedera, T.: An ILP-based proof system for the crossing number problem. In: Proceedings of the ESA 2016. LIPIcs, vol. 57, pp. 29:1–29:13 (2016),
[18]
Clancy K, Haythorpe M, and Newcombe A An effective crossing minimisation heuristic based on star insertion J. Graph Algorithms Appl. 2019 23 2 135-166
[19]
Corno F, Reorda MS, and Squillero G RT-level ITC’99 benchmarks and first ATPG results IEEE Des. Test Comput. 2000 17 3 44-53
[20]
Garey MR and Johnson DS Crossing number is NP-complete SIAM J. Algebraic Discrete Methods 1983 4 3 312-316
[21]
Gutwenger, C.: Application of SPQR-Trees in the Planarization Approach for Drawing Graphs. Ph.D. thesis, TU Dortmund, Dortmund, Germany (2010). http://hdl.handle.net/2003/27430
[22]
Gutwenger C and Mutzel P Liotta G An experimental study of crossing minimization heuristics Graph Drawing 2004 Heidelberg Springer 13-24
[23]
Gutwenger C, Mutzel P, and Weiskircher R Inserting an edge into a planar graph Algorithmica 2005 41 4 289-308
[24]
Hlinený P Crossing number is hard for cubic graphs J. Comb. Theory Ser. B 2006 96 4 455-471
[25]
Hopcroft JE and Tarjan RE Efficient algorithms for graph manipulation [H] (algorithm 447) Commun. ACM 1973 16 6 372-378
[26]
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Plenum Press, New York (1972).
[27]
Steger A and Wormald NC Generating random regular graphs quickly Comb. Probab. Comput. 1999 8 4 377-396
[28]
Ziegler, T.: Crossing minimization in automatic graph drawing. Ph.D. thesis, Saarland University, Saarbrücken, Germany (2001). http://d-nb.info/961610808
Index Terms
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Index terms have been assigned to the content through auto-classification.
Recommendations
The Crossing Number of Twisted Graphs
AbstractWe consider twisted graphs, that is, topological graphs that are weakly isomorphic to subgraphs of the complete twisted graph We determine the exact minimum number of crossings of edges among the set of twisted graphs with n vertices and m ...
Approximating the Crossing Number of Apex Graphs
Graph DrawingWe show that the crossing number of an apex graph, i.e. a graph G from which only one vertex v has to be removed to make it planar, can be approximated up to a factor of Δ(G − v)·d(v)/2 by solving the vertex inserting problem, i.e. inserting a vertex ...
Improvement on the Crossing Number of Crossing-Critical Graphs
AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. ...
Comments
Information & Contributors
Information
Published In
Sep 2021
464 pages
© Springer Nature Switzerland AG 2021.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 14 September 2021
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Jan 2025
Other Metrics
Citations
Cited By
View all- Evers MLinsen L(2024)2D Embeddings of Multi-Dimensional PartitioningsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345639431:1(218-228)Online publication date: 11-Sep-2024