Determining the span of an upward-planar graph is NP-complete for directed trees but polynomial-time solvable for graphs with a bounded number of sources or prescribed embeddings.
12 Guido Brückner and Ignaz Rutter
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Upward-Planar Drawings with Bounded Span
Determining the span of an upward-planar graph is NP-complete for directed trees but polynomial-time solvable for graphs with a bounded number of sources or prescribed embeddings.