Multilevel Planarity

DOI10.7155/jgaa.00554zbMath1457.05105OpenAlexW4235748697MaRDI QIDQ5856666

Paul Jungeblut, Lukas Barth, Guido Brückner, Marcel Radermacher

Publication date: 29 March 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.00554

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Upward drawings of triconnected digraphs.
• Algorithms for plane representations of acyclic digraphs
• Track layouts, layered path decompositions, and leveled planarity
• A characterization of level planar graphs
• A Kuratowski-type theorem for planarity of partially embedded graphs
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• The importance of being proper
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Radial Level Planarity Testing and Embedding in Linear Time
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
• Laying Out Graphs Using Queues
• Two-Processor Scheduling with Start-Times and Deadlines
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Level Planar Embedding in Linear Time
• Partial and Constrained Level Planarity
• Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Testing Planarity of Partially Embedded Graphs
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Practical Level Planarity Testing and Layout with Embedding Constraints
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: Multilevel Planarity