Testing Upward Planarity of Partial 2-Trees

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

doi:10.48550/arXiv.2208.12548

Testing Upward Planarity of Partial 2-Trees

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

Research output: Working paper / Preprint › Preprint

Abstract

We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.

Original language	English
DOIs	https://doi.org/10.48550/arXiv.2208.12548
Publication status	Published - 26 Aug 2022

Keywords

cs.DS
cs.CG

Access to Document

10.48550/arXiv.2208.12548

Testing Upward Planarity of Partial 2-Trees
Chaplick, S., Di giacomo, E., Frati, F., Ganian, R., Raftopoulou, C. N. & Simonov, K., 2023, Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Revised Selected Papers. Angelini, P. & von Hanxleden, R. (eds.). Springer, Cham, Vol. 13764. p. 175-187 13 p. Chapter 13. (Lecture Notes in Computer Science, Vol. 13764).
Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

Cite this

@techreport{ef62b39edbb442e4bdd375ac4485cfa6,

title = "Testing Upward Planarity of Partial 2-Trees",

abstract = " We present an \$O(n\textasciicircum{}2)\$-time algorithm to test whether an \$n\$-vertex directed partial \$2\$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in \$O(n\textasciicircum{}4)\$ time. ",

keywords = "cs.DS, cs.CG",

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

note = "Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)",

year = "2022",

month = aug,

day = "26",

doi = "10.48550/arXiv.2208.12548",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Testing Upward Planarity of Partial 2-Trees

AU - Chaplick, Steven

AU - Giacomo, Emilio Di

AU - Frati, Fabrizio

AU - Ganian, Robert

AU - Raftopoulou, Chrysanthi N.

AU - Simonov, Kirill

N1 - Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)

PY - 2022/8/26

Y1 - 2022/8/26

N2 - We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.

AB - We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.

KW - cs.DS

KW - cs.CG

U2 - 10.48550/arXiv.2208.12548

DO - 10.48550/arXiv.2208.12548

M3 - Preprint

BT - Testing Upward Planarity of Partial 2-Trees

ER -

Testing Upward Planarity of Partial 2-Trees

Abstract

Keywords

Access to Document

Fingerprint

Research output

Testing Upward Planarity of Partial 2-Trees

Cite this