Upward Planarity Testing of Embedded Mixed Graphs

DOI10.1007/978-3-642-25878-7_40zbMath1311.68104OpenAlexW165454349MaRDI QIDQ3223974

Walter Didimo, Carla Binucci

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_40

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Upward and quasi-upward planarity testing of embedded mixed graphs

Cites Work

• Maximum upward planar subgraphs of embedded planar digraphs
• Upward drawings of triconnected digraphs.
• Upward planarity testing
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Upward Spirality and Upward Planarity Testing
• An Approach for Mixed Upward Planarization
• Upward Embeddings and Orientations of Undirected Planar Graphs
• Upward Planar Drawings and Switch-regularity Heuristics
• Digraphs

This page was built for publication: Upward Planarity Testing of Embedded Mixed Graphs