Abstract
Given k input graphs , where each pair with \(i \ne j\) shares the same graph G, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all drawings coincide on G. While SEFE is still open for the case of two input graphs, the problem is NP-complete for \(k \ge 3\) [18].
In this work, we explore the parameterized complexity of SEFE. We show that SEFE is FPT with respect to k plus the vertex cover number or the feedback edge set number of the union graph . Regarding the shared graph G, we show that SEFE is NP-complete, even if G is a tree with maximum degree 4. Together with a known NP-hardness reduction [1], this allows us to conclude that several parameters of G, including the maximum degree, the maximum number of degree-1 neighbors, the vertex cover number, and the number of cutvertices are intractable. We also settle the tractability of all pairs of these parameters. We give FPT algorithms for the vertex cover number plus either of the first two parameters and for the number of cutvertices plus the maximum degree, whereas we prove all remaining combinations to be intractable.
Funded by the Deutsche Forschungsgemeinschaft (German Research Foundation, DFG) under grant RU-1903/3-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71–89 (2015). https://doi.org/10.1016/j.tcs.2014.11.016
Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. 24(4), 603–620 (2020). https://doi.org/10.7155/jgaa.00526
Binucci, C., et al.: On the complexity of the storyplan problem. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 304–318. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-22203-0_22
Bläsius, T., Fink, S.D., Rutter, I.: Synchronized planarity with applications to constrained planarity problems. In: Mutzel, P., Pagh, R., Herman, G. (eds.) Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021). LIPIcs, vol. 204, pp. 19:1–19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.ESA.2021.19
Bläsius, T., Karrer, A., Rutter, I.: Simultaneous embedding: edge orderings, relative positions, cutvertices. Algorithmica 80(4), 1214–1277 (2018). https://doi.org/10.1007/s00453-017-0301-9
Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 349–381. Chapman and Hall/CRC (2013)
Bläsius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6), 459–478 (2015). https://doi.org/10.1016/j.comgeo.2015.02.002
Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010). https://doi.org/10.1016/j.tcs.2010.06.026
Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302–318 (1996). https://doi.org/10.1007/BF01961541
Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Algorithms Appl. 9(3), 347–364 (2005). https://doi.org/10.7155/jgaa.00113
Fink, S.D., Pfretzschner, M., Rutter, I.: Parameterized complexity of simultaneous planarity. CoRR abs/2308.11401 (2023). https://doi.org/10.48550/arXiv.2308.11401
Fulek, R., Tóth, C.D.: Atomic embeddability, clustered planarity, and thickenability. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, (SODA 2020), pp. 2876–2895. SIAM (2020). https://doi.org/10.1137/1.9781611975994.175
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). https://doi.org/10.1007/11917496_29
Jünger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. J. Graph Algorithms Appl. 13(2), 205–218 (2009). https://doi.org/10.7155/jgaa.00184
Opatrny, J.: Total ordering problem. SIAM J. Comput. 8(1), 111–114 (1979). https://doi.org/10.1137/0208008
Patrignani, M.: Planarity testing and embedding. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 1–42. Chapman and Hall/CRC (2013)
Rutter, I.: Simultaneous embedding. In: Hong, S.-H., Tokuyama, T. (eds.) Beyond Planar Graphs, pp. 237–265. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-6533-5_13
Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367–440 (2013). https://doi.org/10.7155/jgaa.00298
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Fink, S.D., Pfretzschner, M., Rutter, I. (2023). Parameterized Complexity of Simultaneous Planarity. In: Bekos, M.A., Chimani, M. (eds) Graph Drawing and Network Visualization. GD 2023. Lecture Notes in Computer Science, vol 14466. Springer, Cham. https://doi.org/10.1007/978-3-031-49275-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-49275-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49274-7
Online ISBN: 978-3-031-49275-4
eBook Packages: Computer ScienceComputer Science (R0)