Parameterized Algorithms for Upward Planarity

Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov

doi:10.4230/LIPICS.SOCG.2022.26

Parameterized Algorithms for Upward Planarity

Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

Abstract

We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algorithm parameterized by treewidth, and a fixed-parameter algorithm parameterized by treedepth. All three algorithms are obtained using a novel framework for the problem that combines SPQR tree-decompositions with parameterized techniques. Our approach unifies and pushes beyond previous tractability results for the problem on series-parallel digraphs, single-source digraphs and outerplanar digraphs.

Original language	English
Title of host publication	38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany
Publisher	Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Pages	26:1-26:16
Volume	224
DOIs	https://doi.org/10.4230/LIPICS.SOCG.2022.26
Publication status	Published - 2022
Event	38th International Symposium on Computational Geometry - Berlin, Germany Duration: 7 Jun 2022 → 10 Jun 2022

Publication series

Series	Leibniz International Proceedings in Informatics (LIPIcs)
Volume	224
ISSN	1868-8969

Symposium

Symposium	38th International Symposium on Computational Geometry
Abbreviated title	SoCG 2022
Country/Territory	Germany
City	Berlin
Period	7/06/22 → 10/06/22

Access to Document

10.4230/LIPICS.SOCG.2022.26

https://dblp.org/rec/conf/compgeom/ChaplickGFGRS22

1 Preprint

Parameterized Algorithms for Upward Planarity
Chaplick, S., Giacomo, E. D., Frati, F., Ganian, R., Raftopoulou, C. N. & Simonov, K., 10 Mar 2022.
Research output: Working paper / Preprint › Preprint

Cite this

@inbook{01e0250d90394e8ca764c52fa435d719,

title = "Parameterized Algorithms for Upward Planarity",

abstract = "We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algorithm parameterized by treewidth, and a fixed-parameter algorithm parameterized by treedepth. All three algorithms are obtained using a novel framework for the problem that combines SPQR tree-decompositions with parameterized techniques. Our approach unifies and pushes beyond previous tractability results for the problem on series-parallel digraphs, single-source digraphs and outerplanar digraphs.",

author = "Steven Chaplick and Giacomo, {Emilio Di} and Fabrizio Frati and Robert Ganian and Raftopoulou, {Chrysanthi N.} and Kirill Simonov",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 38th International Symposium on Computational Geometry, SoCG 2022 ; Conference date: 07-06-2022 Through 10-06-2022",

year = "2022",

doi = "10.4230/LIPICS.SOCG.2022.26",

language = "English",

volume = "224",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",

pages = "26:1--26:16",

booktitle = "38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany",

address = "Germany",

}

Chaplick, S, Giacomo, ED, Frati, F, Ganian, R, Raftopoulou, CN & Simonov, K 2022, Parameterized Algorithms for Upward Planarity. in 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany. vol. 224, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Leibniz International Proceedings in Informatics (LIPIcs), vol. 224, pp. 26:1-26:16, 38th International Symposium on Computational Geometry, Berlin, Germany, 7/06/22. https://doi.org/10.4230/LIPICS.SOCG.2022.26

Parameterized Algorithms for Upward Planarity. / Chaplick, Steven; Giacomo, Emilio Di; Frati, Fabrizio et al.
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany. Vol. 224 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2022. p. 26:1-26:16 (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 224).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - Parameterized Algorithms for Upward Planarity

AU - Chaplick, Steven

AU - Giacomo, Emilio Di

AU - Frati, Fabrizio

AU - Ganian, Robert

AU - Raftopoulou, Chrysanthi N.

AU - Simonov, Kirill

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2022

Y1 - 2022

N2 - We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algorithm parameterized by treewidth, and a fixed-parameter algorithm parameterized by treedepth. All three algorithms are obtained using a novel framework for the problem that combines SPQR tree-decompositions with parameterized techniques. Our approach unifies and pushes beyond previous tractability results for the problem on series-parallel digraphs, single-source digraphs and outerplanar digraphs.

AB - We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algorithm parameterized by treewidth, and a fixed-parameter algorithm parameterized by treedepth. All three algorithms are obtained using a novel framework for the problem that combines SPQR tree-decompositions with parameterized techniques. Our approach unifies and pushes beyond previous tractability results for the problem on series-parallel digraphs, single-source digraphs and outerplanar digraphs.

U2 - 10.4230/LIPICS.SOCG.2022.26

DO - 10.4230/LIPICS.SOCG.2022.26

M3 - Chapter

VL - 224

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 26:1-26:16

BT - 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany

PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

T2 - 38th International Symposium on Computational Geometry

Y2 - 7 June 2022 through 10 June 2022

ER -

Chaplick S, Giacomo ED, Frati F, Ganian R, Raftopoulou CN, Simonov K. Parameterized Algorithms for Upward Planarity. In 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany. Vol. 224. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. 2022. p. 26:1-26:16. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 224). doi: 10.4230/LIPICS.SOCG.2022.26