EUVIMEDEUVIMED entdecken
Crossref

Testing Planarity of Partially Embedded Graphs

Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter

ACM Transactions on Algorithms · 23.06.2015 · 11 (4) · 1-42

DOI: 10.1145/2629341 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Algorithms, online erschienen am 13.04.2015. Verfasst von Patrizio Angelini und 6 weiteren Autor:innen. Die Arbeit wurde bisher 35-mal zitiert (Crossref) und nennt 48 Literaturangaben. Gefördert von: fellowship within the postdoctoral program of the German Academic Exchange Service (DAAD), Australian Research Council, ESF EuroGIGA GraDR as Czech Research.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the following problem: given a planar graph G and a planar drawing (embedding) of a subgraph of G , can such a drawing be extended to a planar drawing of the entire graph G ? This problem fits the paradigm of extending a partial solution for a problem to a complete one, which has been studied before in many different settings. Unlike many cases, in which the presence of a partial solution in the input makes an otherwise easy problem hard, we show that the planarity question remains polynomial-time solvable. Our algorithm is based on several combinatorial lemmas, which show that the planarity of partially embedded graphs exhibits the ‘TONCAS’ behavior “the obvious necessary conditions for planarity are also sufficient.” These conditions are expressed in terms of the interplay between (1) the rotation system and containment relationships between cycles and (2) the decomposition of a graph into its connected, biconnected, and triconnected components. This implies that no dynamic programming is needed for a decision algorithm and that the elements of the decomposition can be processed independently. Further, by equipping the components of the decomposition with suitable data structures and by carefully splitting the problem into simpler subproblems, we make our algorithm run in linear time. Finally, we consider several generalizations of the problem, such as minimizing the number of edges of the partial embedding that need to be rerouted to extend it, and argue that they are NP-hard. We also apply our algorithm to the simultaneous graph drawing problem Simultaneous Embedding with Fixed Edges (Sefe) . There we obtain a linear-time algorithm for the case that one of the input graphs or the common graph has a fixed planar embedding.

Förderung

  • fellowship within the postdoctoral program of the German Academic Exchange Service (DAAD)
  • Australian Research Council
  • ESF EuroGIGA GraDR as Czech Research
  • MIUR project AMANDA (Algorithmics for Massive and Networked Data) protocol 2012C4E3KT_001

Zitieren

APA

Angelini, P., Battista, G. D., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., & Rutter, I. (2015). Testing Planarity of Partially Embedded Graphs. ACM Transactions on Algorithms, 11(4), 1-42. https://doi.org/10.1145/2629341

Vancouver

Angelini P, Battista GD, Frati F, Jelínek V, Kratochvíl J, Patrignani M, et al. Testing Planarity of Partially Embedded Graphs. ACM Transactions on Algorithms. 2015;11(4):1-42. doi:10.1145/2629341

BibTeX
@article{Angelini2015,
  author = {Angelini, Patrizio and Battista, Giuseppe Di and Frati, Fabrizio and Jelínek, Vít and Kratochvíl, Jan and Patrignani, Maurizio and Rutter, Ignaz},
  title = {Testing Planarity of Partially Embedded Graphs},
  journal = {ACM Transactions on Algorithms},
  year = {2015},
  volume = {11},
  number = {4},
  pages = {1--42},
  doi = {10.1145/2629341}
}
Kostenlos starten →