Testing Upward Planarity of Partial $2$-Trees
Data Structures and Algorithms
2022-08-29 v1 Computational Geometry
Abstract
We present an -time algorithm to test whether an -vertex directed partial -tree is upward planar. This result improves upon the previously best known algorithm, which runs in time.
Keywords
Cite
@article{arxiv.2208.12548,
title = {Testing Upward Planarity of Partial $2$-Trees},
author = {Steven Chaplick and Emilio Di Giacomo and Fabrizio Frati and Robert Ganian and Chrysanthi N. Raftopoulou and Kirill Simonov},
journal= {arXiv preprint arXiv:2208.12548},
year = {2022}
}
Comments
Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)