An SPQR-Tree-Like Embedding Representation for Upward Planarity

08/01/2019
by   Guido Brückner, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset