Document Open Access Logo

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable

Authors Liana Khazaliya , Philipp Kindermann , Giuseppe Liotta , Fabrizio Montecchiani , Kirill Simonov

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2023.46.pdf
  • Filesize: 0.89 MB
  • 13 pages

Document Identifiers

Author Details

Liana Khazaliya
  • Technische Universität Wien, Austria
Philipp Kindermann
  • FB IV - Informatikwissenschaften, Universität Trier, Germany
Giuseppe Liotta
  • Department of Engineering, University of Perugia, Italy
Fabrizio Montecchiani
  • Department of Engineering, University of Perugia, Italy
Kirill Simonov
  • Hasso Plattner Institute, Universität Potsdam, Germany

Funding

Research of LK supported by WWTF (Project ICT22-029); European Union’s Horizon 2020 COFUND programme [LogiCS@TUWien, grant agreement No.101034440]. Research of GL and FM partially supported by MUR of Italy, under PRIN Project n. 2022ME9Z78 - NextGRAAL: Next-generation algorithms for constrained GRAph visuALization, and under PRIN Project n. 2022TS4Y3N - EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.

Acknowledgements

This research was initiated at Dagstuhl Seminar 23162: New Frontiers of Parameterized Complexity in Graph Drawing.

Cite AsGet BibTex

Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov. The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ISAAC.2023.46

Abstract

The problem of deciding whether a biconnected planar digraph G = (V,E) can be augmented to become an st-planar graph by adding a set of oriented edges E' ⊆ V × V is known to be NP-complete. We show that the problem is fixed-parameter tractable when parameterized by the size of the set E'.

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
  • Mathematics of computing → Graph algorithms
Keywords
  • st-planar graphs
  • parameterized complexity
  • upward planarity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Paola Bertolazzi, Giuseppe Di Battista, and Walter Didimo. Quasi-upward planarity. Algorithmica, 32(3):474-506, 2002. Google Scholar
  2. Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, and Carlo Mannino. Upward drawings of triconnected digraphs. Algorithmica, 12(6):476-497, 1994. Google Scholar
  3. Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, and Alessandra Tappini. Quasi-upward planar drawings with minimum curve complexity. In GD, volume 12868 of Lecture Notes in Computer Science, pages 195-209. Springer, 2021. Google Scholar
  4. Pablo Burzyn, Flavia Bonomo, and Guillermo Durán. NP-completeness results for edge modification problems. Discret. Appl. Math., 154(13):1824-1844, 2006. URL: https://doi.org/10.1016/j.dam.2006.03.031.
  5. Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Parameterized algorithms for upward planarity. In SoCG, volume 224 of LIPIcs, pages 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  6. Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Testing upward planarity of partial 2-trees. In GD, volume 13764 of Lecture Notes in Computer Science, pages 175-187. Springer, 2022. Google Scholar
  7. Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, and Petr A. Golovach. A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev., 48:100556, 2023. URL: https://doi.org/10.1016/j.cosrev.2023.100556.
  8. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999. Google Scholar
  9. Giuseppe Di Battista, Giuseppe Liotta, and Francesco Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764-1811, 1998. Google Scholar
  10. Giuseppe Di Battista and Roberto Tamassia. Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci., 61:175-198, 1988. Google Scholar
  11. Walter Didimo, Francesco Giordano, and Giuseppe Liotta. Upward spirality and upward planarity testing. SIAM J. Discret. Math., 23(4):1842-1899, 2009. Google Scholar
  12. Walter Didimo, Michael Kaufmann, Giuseppe Liotta, and Giacomo Ortali. Rectilinear planarity of partial 2-trees. In GD, volume 13764 of Lecture Notes in Computer Science, pages 157-172. Springer, 2022. Google Scholar
  13. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput., 31(2):601-625, 2001. Google Scholar
  14. Carsten Gutwenger and Petra Mutzel. A linear time implementation of SPQR-trees. In GD 2000, volume 1984 of LNCS, pages 77-90. Springer, 2001. URL: https://doi.org/10.1007/3-540-44541-2.
  15. John E. Hopcroft and Robert Endre Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2(3):135-158, 1973. URL: https://doi.org/10.1137/0202012.
  16. Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov. The st-planar edge completion problem is fixed-parameter tractable. CoRR, abs/2309.15454, 2023. URL: https://arxiv.org/abs/2309.15454.
  17. Assaf Natanzon, Ron Shamir, and Roded Sharan. Complexity classification of some edge modification problems. Discret. Appl. Math., 113(1):109-128, 2001. URL: https://doi.org/10.1016/S0166-218X(00)00391-7.
  18. William T. Trotter and John I. Moore Jr. The dimension of planar posets. J. Comb. Theory, Ser. B, 22(1):54-67, 1977. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact