Building blocks of upward planar digraphs

Patrick Healy, Karol Lynch

Research output: Contribution to journalArticlepeer-review

Abstract

The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross. In this paper we reduce the problem of testing a digraph for upward planarity to the problem of testing if its blocks admit upward planar drawings with certain properties. We also show how to test if a block of a digraph admits an upward planar drawing with the aforementioned properties.

Original languageEnglish
Pages (from-to)3-44
Number of pages42
JournalJournal of Graph Algorithms and Applications
Volume11
Issue number1
DOIs
Publication statusPublished - 2007

Fingerprint

Dive into the research topics of 'Building blocks of upward planar digraphs'. Together they form a unique fingerprint.

Cite this