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 proceedingChapterAcademic

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 languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 30th International Symposium, GD 2022, Revised Selected Papers
EditorsPatrizio Angelini, Reinhard von Hanxleden
PublisherSpringer, Cham
Pages175-187
Number of pages13
Volume13764
ISBN (Electronic)978-3-031-22203-0
ISBN (Print)978-3-031-22202-3
DOIs
Publication statusPublished - 2023
EventThe 30th International Symposium on Graph Drawing and Network Visualization - Tokyo, Japan
Duration: 13 Sept 202216 Sept 2022
https://graphdrawing.github.io/gd2022/

Publication series

SeriesLecture Notes in Computer Science
Volume13764
ISSN0302-9743

Symposium

SymposiumThe 30th International Symposium on Graph Drawing and Network Visualization
Abbreviated titleGD 2022
Country/TerritoryJapan
CityTokyo
Period13/09/2216/09/22
Internet address

Fingerprint

Dive into the research topics of 'Testing Upward Planarity of Partial 2-Trees'. Together they form a unique fingerprint.
  • 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 / PreprintPreprint

Cite this