Portal de Periódicos da CAPES

An SPQR-Tree-Like Embedding Representation for Upward Planarity

2019; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-030-35802-0_39

1611-3349

Guido Brückner, Markus Himmel, Ignaz Rutter,

Model-Driven Software Engineering Techniques

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.