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 - 30th International Symposium, GD 2022, Revised Selected Papers |
| Editors | Patrizio Angelini, Reinhard von Hanxleden |
| Publisher | Springer, Cham |
| Pages | 175-187 |
| Number of pages | 13 |
| Volume | 13764 |
| ISBN (Electronic) | 978-3-031-22203-0 |
| ISBN (Print) | 978-3-031-22202-3 |
| DOIs | |
| 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 |
Fingerprint
Dive into the research topics of 'Testing Upward Planarity of Partial 2-Trees'. Together they form a unique fingerprint.Research output
- 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver