Strip planarity testing

DOI10.1007/978-3-319-03841-4_4zbMATH Open1406.68056OpenAlexW191095475MaRDI QIDQ2867641FDOQ2867641

Authors: Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati 

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_4

Recommendations

• Strip planarity testing for embedded planar graphs
• Multilevel planarity
• Multilevel planarity
• Level Planar Embedding in Linear Time
• SOFSEM 2004: Theory and Practice of Computer Science

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (7)

• Clustered planarity = flat clustered planarity
• Towards the Hanani-Tutte theorem for clustered graphs
• Hanani-Tutte for Radial Planarity II
• Bounded Embeddings of Graphs in the Plane
• Clustered planarity testing revisited
• C-planarity of embedded cyclic c-graphs
• Strip planarity testing for embedded planar graphs

This page was built for publication: Strip planarity testing

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