SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/B95046MaRDI QIDQ5902004zbMATH OpenOpenAlexFDO

Authors Michael Forster, Christian Bachmaier

Publication date 4 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95046

zbMATH Keywords

planaritygraph drawingclustered graphsplanar drawingk-level graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Planarity for clustered graphs
• The importance of being proper (in clustered-level planarity and \(T\)-level planarity)
• The importance of being proper
• Multilevel drawings of clustered graphs
• Clustered planarity = flat clustered planarity

Cited in

(12)

• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Multilevel drawings of clustered graphs
• \((k,p)\)-planarity: a relaxation of hybrid planarity
• The importance of being proper (in clustered-level planarity and \(T\)-level planarity)
• \((k, p)\)-planarity: a relaxation of hybrid planarity
• Multilevel planarity
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• Strip planarity testing
• Some Constrained Notions of Planarity
• Beyond level planarity
• Strip planarity testing for embedded planar graphs
• The importance of being proper

This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science

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