Algorithms for multi-level graph planarity testing and layout

DOI10.1016/J.TCS.2004.02.033zbMATH Open1068.05064OpenAlexW1968583064MaRDI QIDQ596102FDOQ596102

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

Recommendations

• scientific article; zbMATH DE number 1500684
• Multilevel planarity
• Multilevel planarity
• Practical Level Planarity Testing and Layout with Embedding Constraints
• Level Planar Embedding in Linear Time

zbMATH Keywords

Level graph layoutLevel graphsLevel planarity testing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Edge crossings in drawings of bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Multi-circular Layout of Micro/Macro Graphs
• Cyclic Level Planarity Testing and Embedding
• Title not available (Why is that?)
• Crossing Minimization in Storyline Visualization
• Practical Level Planarity Testing and Layout with Embedding Constraints
• Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

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

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