Multilevel planarity

DOI10.1007/978-3-030-10564-8_18MaRDI QIDQ5236170zbMATH OpenOpenAlexFDO

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

Publication date 15 October 2019

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.13297

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Multilevel planarity
• Level Planar Embedding in Linear Time
• Upward planarity testing
• Algorithms for multi-level graph planarity testing and layout
• Partial and Constrained Level Planarity

Cited in

(10)

• Lower levels of Euclidean planes
• HV-planarity: algorithms and complexity
• The importance of being proper
• Strip planarity testing
• The importance of being proper (in clustered-level planarity and T-level planarity)
• scientific article; zbMATH DE number 1500684 (Why is no real title available?)
• Partial and Constrained Level Planarity
• Strip planarity testing for embedded planar graphs
• Multilevel planarity
• Algorithms for multi-level graph planarity testing and layout

This page was built for publication: Multilevel planarity

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