Cited By
View all- Angelini PBekos M(2019)Hierarchical Partial PlanarityAlgorithmica10.1007/s00453-018-0530-681:6(2196-2221)Online publication date: 1-Jun-2019
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Authors: 
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. TollisAuthors Info & Claims
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. TollisAuthors Info & ClaimsPages 34 - 48
Abstract
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing of G in the plane such that the edges of S are not crossed in by any edge of G__ __ We give positive and negative results for different kinds of connected spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G not in S; in this setting we discuss different trade-offs between the number of bends and the required drawing area.
References
[1]
E. Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, Discrete Comput. Geom., 41 (2009) 365-375.
[2]
E. Ackerman, G. Tardos, On the maximum number of edges in quasi-planar graphs, J. Comb. Theory, Ser. A, 114 (2007) 563-571.
[3]
P. Angelini, G. Da Lozzo, D. Neuwirth, Advancements on SEFE and partitioned book embedding problems, Theor. Comput. Sci., 575 (2015) 71-89.
[4]
P. Angelini, G. Di Battista, F. Frati, M. Patrignani, I. Rutter, Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph, J. Discrete Algorithms, 14 (2012) 150-172.
[5]
I. Bárány, G. Rote, Strictly convex drawings of planar graphs, Doc. Math., 11 (2006) 369-391.
[6]
T. Bläsius, A. Karrer, I. Rutter, Simultaneous embedding: edge orderings, relative positions, cutvertices, in: LNCS, vol. 8242, Springer, 2014, pp. 222-233.
[7]
T. Bläsius, S.G. Kobourov, I. Rutter, Simultaneous embedding of planar graphs, in: Handbook of Graph Drawing and Visualization, CRC Press, 2013.
[8]
F.-J. Brandenburg, D. Eppstein, A. Glei¿ßner, M.T. Goodrich, K. Hanauer, J. Reislhuber, On the density of maximal 1-planar graphs, in: LNCS, vol. 7704, Springer, 2012, pp. 327-338.
[9]
C. Buchheim, M. Chimani, C. Gutwenger, M. Jünger, P. Mutzel, Crossings and planarization, in: Handbook of Graph Drawing and Visualization, CRC Press, 2013.
[10]
G. Da Lozzo, I. Rutter, Planarity of streamed graphs, in: LNCS, vol. 9079, Springer, 2015, pp. 153-166.
[11]
H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10 (1990) 41-51.
[12]
G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
[13]
E. Di Giacomo, W. Didimo, G. Liotta, F. Montecchiani, h-Quasi planar drawings of bounded treewidth graphs in linear area, in: LNCS, vol. 7551, Springer, 2012, pp. 91-102.
[14]
E. Di Giacomo, W. Didimo, G. Liotta, F. Montecchiani, Area requirement of graph drawings with few crossings per edge, Comput. Geom., 46 (2013) 909-916.
[15]
W. Didimo, Density of straight-line 1-planar graph drawings, Inf. Process. Lett., 113 (2013) 236-240.
[16]
W. Didimo, P. Eades, G. Liotta, Drawing graphs with right angle crossings, Theor. Comput. Sci., 412 (2011) 5156-5166.
[17]
W. Didimo, G. Liotta, The crossing angle resolution in graph drawing, in: Thirty Essays on Geometric Graph Theory, Springer, 2012.
[18]
P. Eades, S.-H. Hong, N. Katoh, G. Liotta, P. Schweitzer, Y. Suzuki, Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract), in: LNCS, vol. 7704, Springer, 2012, pp. 339-345.
[19]
J. Fox, J. Pach, A. Suk, The number of edges in k-quasi-planar graphs, SIAM J. Discrete Math., 27 (2013) 550-561.
[20]
B. Haeupler, K.R. Jampani, A. Lubiw, Testing simultaneous planarity when the common graph is 2-connected, J. Graph Algorithms Appl., 17 (2013) 147-171.
[21]
S.-H. Hong, P. Eades, G. Liotta, S.-H. Poon, Fáry's theorem for 1-planar graphs, in: LNCS, vol. 7434, Springer, 2012, pp. 335-346.
[22]
W. Huang, S.-H. Hong, P. Eades, Effects of crossing angles, in: PacificVis, IEEE, 2008, pp. 41-46.
[23]
K. Jansen, G.J. Woeginger, The complexity of detecting crossingfree configurations in the plane, BIT Numer. Math., 33 (1993) 580-595.
[24]
G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996) 4-32.
[25]
C. Knauer, É. Schramm, A. Spillner, A. Wolff, Configurations with few crossings in topological graphs, Comput. Geom., 37 (2007) 104-114.
[26]
V.P. Korzhik, B. Mohar, Minimal obstructions for 1-immersions and hardness of 1-planarity testing, J. Graph Theory, 72 (2013) 30-71.
[27]
L. Kowalik, M. Kurowski, Short path queries in planar graphs in constant time, in: STOC, ACM, 2003, pp. 143-148.
[28]
J. Kratochvìl, A. Lubiv, J. Nešetřil, Noncrossing subgraphs in topological layouts, SIAM J. Discrete Math., 4 (1991) 223-244.
[29]
J. Pach, F. Shahrokhi, M. Szegedy, Applications of the crossing number, Algorithmica, 16 (1996) 111-117.
[30]
J. Pach, G. Tóth, Graphs drawn with few crossings per edge, Combinatorica, 17 (1997) 427-439.
[31]
E. Rivera-Campo, V. Urrutia-Galicia, A sufficient condition for the existence of plane spanning trees on geometric graphs, Comput. Geom., 46 (2013) 1-6.
[32]
M. Schaefer, Picking planar edges or, drawing a graph with a planar subgraph. arXiv:1311.6839
[33]
P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete Comput. Geom., 19 (1998) 461-469.
Index Terms
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Index terms have been assigned to the content through auto-classification.
Recommendations
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
AbstractSymmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs. More specifically, we discuss planar (geometric) automorphisms, ...
Bipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n^' be the maximum number of vertices in an induced bipartite subgraph of G and let m^' be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G)=m^'/m is called the bipartite ...
Drawing Planar Graphs
WALCOM: Algorithms and ComputationAbstractA graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed planar embedding in the plane. A drawing ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 December 2015
Author Tags
Qualifiers
- Research-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 16 Oct 2024
Other Metrics
Citations
Cited By
View all- Angelini PBekos M(2019)Hierarchical Partial PlanarityAlgorithmica10.1007/s00453-018-0530-681:6(2196-2221)Online publication date: 1-Jun-2019
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in