Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of importance, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.

[1]  Jan Kratochvíl,et al.  String graphs. I. The number of critical nonstring graphs is infinite , 1991, J. Comb. Theory, Ser. B.

[2]  Joseph S. B. Mitchell,et al.  On Simultaneous Planar Graph Embeddings , 2003, WADS.

[3]  Jan Kratochvíl,et al.  A Kuratowski-type theorem for planarity of partially embedded graphs , 2013, Comput. Geom..

[4]  Michael T. Goodrich,et al.  Streamed Graph Drawing and the File Maintenance Problem , 2013, GD.

[5]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[6]  Jan Kratochvíl,et al.  Testing planarity of partially embedded graphs , 2010, SODA '10.

[7]  Emilio Di Giacomo,et al.  Planar and Quasi Planar Simultaneous Geometric Embedding , 2014, Graph Drawing.

[8]  Ignaz Rutter,et al.  Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems , 2011, SODA.

[9]  Jan Kratochvíl,et al.  A kuratowski-type theorem for planarity of partially embedded graphs , 2011, SoCG '11.

[10]  Stephen G. Kobourov,et al.  Simultaneous Embedding of Planar Graphs , 2012, Handbook of Graph Drawing and Visualization.

[11]  Jan Kratochvíl,et al.  Simultaneous Orthogonal Planarity , 2016, Graph Drawing.

[12]  Ignaz Rutter,et al.  Disconnectivity and relative positions in simultaneous embeddings , 2015, Comput. Geom..

[13]  Alexander Wolff,et al.  Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends , 2016, J. Graph Algorithms Appl..

[14]  Giordano Da Lozzo,et al.  Advancements on SEFE and Partitioned Book Embedding problems , 2013, Theor. Comput. Sci..

[15]  Ignaz Rutter,et al.  Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph , 2012, J. Discrete Algorithms.

[16]  Timothy M. Chan,et al.  Drawing Partially Embedded and Simultaneously Planar Graphs , 2015, J. Graph Algorithms Appl..

[17]  Ulrik Brandes,et al.  Drawing trees in a streaming model , 2009, Inf. Process. Lett..

[18]  Ignaz Rutter,et al.  Planarity of Streamed Graphs , 2015, CIAC.

[19]  Ioannis G. Tollis,et al.  Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs , 2015, Comput. Geom..

[20]  Lukasz Kowalik,et al.  Oracles for bounded-length shortest paths in planar graphs , 2006, TALG.

[21]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[22]  Marcus Schaefer,et al.  Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph , 2013, GD.

[23]  Michael A. Bekos,et al.  Hierarchical Partial Planarity , 2017, Algorithmica.

[24]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..