Algorithms for multi-level graph planarity testing and layout

DOI10.1016/j.tcs.2004.02.033zbMath1068.05064OpenAlexW1968583064MaRDI QIDQ596102

Ago Kuusik, Patrick Healy

Publication date: 10 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.033

zbMATH Keywords

Level graph layoutLevel graphsLevel planarity testing

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Crossing Minimization in Storyline Visualization ⋮ Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs ⋮ Cyclic Level Planarity Testing and Embedding ⋮ Practical Level Planarity Testing and Layout with Embedding Constraints

Cites Work

• Edge crossings in drawings of bipartite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for multi-level graph planarity testing and layout