An SPQR-Tree-Like Embedding Representation for Upward Planarity
Data Structures and Algorithms
2019-08-02 v1
Abstract
The SPQR-tree is a data structure that compactly represents all planar embeddings of a biconnected planar graph. It plays a key role in constrained planarity testing. We develop a similar data structure, called the UP-tree, that compactly represents all upward planar embeddings of a biconnected single-source directed graph. We demonstrate the usefulness of the UP-tree by solving the upward planar embedding extension problem for biconnected single-source directed graphs.
Cite
@article{arxiv.1908.00352,
title = {An SPQR-Tree-Like Embedding Representation for Upward Planarity},
author = {Guido Brückner and Markus Himmel and Ignaz Rutter},
journal= {arXiv preprint arXiv:1908.00352},
year = {2019}
}
Comments
Appears in the Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)