Radial Level Planarity with Fixed Embedding

DOI10.7155/jgaa.00561zbMath1462.05334OpenAlexW3160958409MaRDI QIDQ4994349

Guido Brückner, Ignaz Rutter

Publication date: 17 June 2021

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00561

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Strip planarity testing for embedded planar graphs
• Upward drawings of triconnected digraphs.
• The complexity of upward drawings on spheres
• Level planarity: transitivity vs. even crossings
• When can you fold a map?
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Hanani–Tutte, Monotone Drawings, and Level-Planarity
• Classification of Planar Upward Embedding
• Radial Level Planarity Testing and Embedding in Linear Time
• Efficient Planarity Testing
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
• Digraph embedding

This page was built for publication: Radial Level Planarity with Fixed Embedding