Upward planarity testing of biconnected outerplanar DAGs solves partition

DOI10.1016/J.TCS.2024.114541MaRDI QIDQ6129708zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati

Publication date 17 April 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2307.13799

zbMATH Keywords

graph drawingouterplanar graphpartitionupward planarity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Upward Planarity Testing: A Computational Study
• Graph Drawing
• Algorithms – ESA 2004
• Upward spirality and upward planarity testing
• Upward planarity testing in practice: SAT formulations and comparative study

Cited in

(1)

• On planar straight-line dominance drawings

This page was built for publication: Upward planarity testing of biconnected outerplanar DAGs solves partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129708)