Testing Upward Planarity of Partial 2-Trees

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

doi:10.1007/978-3-031-22203-0_13

Testing Upward Planarity of Partial 2-Trees

Steven Chaplick, Emilio Di giacomo, Fabrizio Frati^*, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov

^*Corresponding author for this work

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

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
Title of host publication	Graph Drawing and Network Visualization (GD 2022)
Editors	Patrizio Angelini, R. von Hanxleden
Publisher	Springer, Cham
Pages	175-187
Volume	13764
ISBN (Electronic)	978-3-031-22203-0
ISBN (Print)	978-3-031-22202-3
DOIs	https://doi.org/10.1007/978-3-031-22203-0_13
Publication status	Published - 2023
Event	The 30th International Symposium on Graph Drawing and Network Visualization - Tokyo, Japan Duration: 13 Sept 2022 → 16 Sept 2022 https://graphdrawing.github.io/gd2022/

Publication series

Series	Lecture Notes in Computer Science
Volume	13764
ISSN	0302-9743

Symposium

Symposium	The 30th International Symposium on Graph Drawing and Network Visualization
Abbreviated title	GD 2022
Country/Territory	Japan
City	Tokyo
Period	13/09/22 → 16/09/22
Internet address	https://graphdrawing.github.io/gd2022/

Access to Document

10.1007/978-3-031-22203-0_13

https://link.springer.com/10.1007/978-3-031-22203-0_13

1 Preprint

Testing Upward Planarity of Partial 2-Trees
Chaplick, S., Giacomo, E. D., Frati, F., Ganian, R., Raftopoulou, C. N. & Simonov, K., 26 Aug 2022.
Research output: Working paper / Preprint › Preprint

Cite this

@inbook{78f018f69e1345418e63226c42cb3242,

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

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.",

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

note = "Funding Information: Acknowledgments. Ganian and Simonov acknowledge support by the Austrian Science Foundation (FWF Project Y1329). Di Giacomo and Frati acknowledge support by MIUR (PRIN project 20174LF3T8). Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; The 30th International Symposium on Graph Drawing and Network Visualization, GD 2022 ; Conference date: 13-09-2022 Through 16-09-2022",

year = "2023",

doi = "10.1007/978-3-031-22203-0_13",

language = "English",

isbn = "978-3-031-22202-3",

volume = "13764",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

pages = "175--187",

editor = "Patrizio Angelini and {von Hanxleden}, R.",

booktitle = "Graph Drawing and Network Visualization (GD 2022)",

address = "Switzerland",

url = "https://graphdrawing.github.io/gd2022/",

}

Chaplick, S, Di giacomo, E, Frati, F, Ganian, R, Raftopoulou, CN & Simonov, K 2023, Testing Upward Planarity of Partial 2-Trees. in P Angelini & R von Hanxleden (eds), Graph Drawing and Network Visualization (GD 2022). vol. 13764, Chapter 13, Springer, Cham, Lecture Notes in Computer Science, vol. 13764, pp. 175-187, The 30th International Symposium on Graph Drawing and Network Visualization, Tokyo, Japan, 13/09/22. https://doi.org/10.1007/978-3-031-22203-0_13

Testing Upward Planarity of Partial 2-Trees. / Chaplick, Steven; Di giacomo, Emilio; Frati, Fabrizio et al.
Graph Drawing and Network Visualization (GD 2022). ed. / Patrizio Angelini; R. von Hanxleden. Vol. 13764 Springer, Cham, 2023. p. 175-187 Chapter 13 (Lecture Notes in Computer Science, Vol. 13764).

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

TY - CHAP

T1 - Testing Upward Planarity of Partial 2-Trees

AU - Chaplick, Steven

AU - Di giacomo, Emilio

AU - Frati, Fabrizio

AU - Ganian, Robert

AU - Raftopoulou, Chrysanthi N.

AU - Simonov, Kirill

N1 - Funding Information: Acknowledgments. Ganian and Simonov acknowledge support by the Austrian Science Foundation (FWF Project Y1329). Di Giacomo and Frati acknowledge support by MIUR (PRIN project 20174LF3T8). Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

PY - 2023

Y1 - 2023

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.

U2 - 10.1007/978-3-031-22203-0_13

DO - 10.1007/978-3-031-22203-0_13

M3 - Chapter

SN - 978-3-031-22202-3

VL - 13764

T3 - Lecture Notes in Computer Science

SP - 175

EP - 187

BT - Graph Drawing and Network Visualization (GD 2022)

A2 - Angelini, Patrizio

A2 - von Hanxleden, R.

PB - Springer, Cham

T2 - The 30th International Symposium on Graph Drawing and Network Visualization

Y2 - 13 September 2022 through 16 September 2022

ER -