Parameterized Algorithms for Upward Planarity
Computational Geometry
2022-03-11 v1 Data Structures and Algorithms
Abstract
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algorithm parameterized by treewidth, and a fixed-parameter algorithm parameterized by treedepth. All three algorithms are obtained using a novel framework for the problem that combines SPQR tree-decompositions with parameterized techniques. Our approach unifies and pushes beyond previous tractability results for the problem on series-parallel digraphs, single-source digraphs and outerplanar digraphs.
Cite
@article{arxiv.2203.05364,
title = {Parameterized Algorithms for Upward Planarity},
author = {Steven Chaplick and Emilio Di Giacomo and Fabrizio Frati and Robert Ganian and Chrysanthi N. Raftopoulou and Kirill Simonov},
journal= {arXiv preprint arXiv:2203.05364},
year = {2022}
}
Comments
To appear at the 38th International Symposium on Computational Geometry (SoCG 2022)