LIPIcs.GD.2024.43.pdf
- Filesize: 0.57 MB
- 3 pages
Document
Minimizing Switches in Cased Graph Drawings (Poster Abstract)
Authors
Robert Ganian 
,
Martin Nöllenburg ,
Sebastian Röder
-
Part of:
Volume:
32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Graph Drawing and Network Visualization (GD) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-28
File
Document Identifiers
Author Details
Cite AsGet BibTex
Robert Ganian, Martin Nöllenburg, and Sebastian Röder. Minimizing Switches in Cased Graph Drawings (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 43:1-43:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.43
https://doi.org/10.4230/LIPIcs.GD.2024.43
Abstract
In cased drawings of graphs, edges are drawn in front of others in order to decrease the negative impact of crossings on readability. In this context, a switch on an edge is defined as two consecutive crossings, where the edge is drawn in the front at one crossing and behind another edge at the next crossing. We investigate the problem of minimizing the maximum number of switches on any edge - both in a fixed drawing as well as for non-embedded graphs. We resolve an open question by Eppstein, van Kreveld, Mumford, and Speckmann (2009) by establishing the NP-hardness of minimizing the number of switches in a fixed drawing, provide a fixed-parameter algorithm for this problem, and obtain a full characterization of the problem for non-embedded graphs.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph theory
- Human-centered computing → Graph drawings
Keywords
- beyond planarity
- complexity theory
- non-planar drawings
- crossings
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, and Csaba D. Tóth. Gap-planar graphs. Theoretical Computer Science, 745:36-52, October 2018. URL: https://doi.org/10.1016/j.tcs.2018.05.029.
- David Eppstein, Marc Van Kreveld, Elena Mumford, and Bettina Speckmann. Edges and switches, tunnels and bridges. Computational Geometry, 42(8):790-802, October 2009. URL: https://doi.org/10.1016/j.comgeo.2008.05.005.
- Anthony Mansfield. Determining the thickness of graphs is NP-hard. Mathematical Proceedings of the Cambridge Philosophical Society, 93(1):9-23, 1983. URL: https://doi.org/10.1017/S030500410006028X.
- Thomas J. Schaefer. The complexity of satisfiability problems. In Theory of Computing (STOC'78), pages 216-226. ACM Press, 1978. URL: https://doi.org/10.1145/800133.804350.