Abstract
A simultaneous embedding of two graphs \(G^{\mbox{\textcircled{1}}}\) and \(G^{\mbox{\textcircled{2}}}\) with common graph \(G=G^{\mbox{\textcircled{1}}} \cap G^{\mbox{\textcircled{2}}}\) is a pair of planar drawings of \(G^{\mbox{\textcircled{1}}}\) and \(G^{\mbox{\textcircled{2}}}\) that coincide on G. It is an open question whether there is a polynomial-time algorithm that decides whether two graphs admit a simultaneous embedding (problem Sefe).
In this paper, we present two results. First, a set of three linear-time preprocessing algorithms that remove certain substructures from a given Sefe instance, producing a set of equivalent Sefe instances without such substructures. The structures we can remove are (1) cutvertices of the union graph \(G^{\mbox{\textcircled{1}}} \cup G^{\mbox{\textcircled{2}}}\), (2) cutvertices that are simultaneously a cutvertex in \(G^{\mbox{\textcircled{1}}}\) and \(G^{\mbox{\textcircled{2}}}\) and that have degree at most 3 in G, and (3) connected components of G that are biconnected but not a cycle.
Second, we give an O(n 2)-time algorithm for Sefe where, for each pole u of a P-node μ (of a block) of the input graphs, at most three virtual edges of μ contain common edges incident to u. All algorithms extend to the sunflower case.
Partly done within GRADR – EUROGIGA project no. 10-EuroGIGA-OP-003.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. Journal of Discrete Algorithms 14, 150–172 (2012)
Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous Embedding of Planar Graphs. In: Handbook of Graph Drawing and Visualization, pp. 349–381. Chapman and Hall/CRC (2013)
Bläsius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 31–42. Springer, Heidelberg (2013)
Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: Proc. 24th ACM-SIAM Sympos. Discrete Algorithm, SODA 2013, pp. 1030–1043. ACM (2013)
Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)
Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302–318 (1996)
Gassner, E., Jünger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embeddings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 325–335. Springer, Heidelberg (2006)
Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77–90. Springer, Heidelberg (2001)
Haeupler, B., Jampani, K., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms Appl. 17(3), 147–171 (2013)
Jünger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. Journal of Graph Algorithms and Applications 13(2), 205–218 (2009)
Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 162–173. Springer, Heidelberg (2013)
Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory 32(1), 54–62 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Bläsius, T., Karrer, A., Rutter, I. (2013). Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. In: Wismath, S., Wolff, A. (eds) Graph Drawing. GD 2013. Lecture Notes in Computer Science, vol 8242. Springer, Cham. https://doi.org/10.1007/978-3-319-03841-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-03841-4_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03840-7
Online ISBN: 978-3-319-03841-4
eBook Packages: Computer ScienceComputer Science (R0)