Shrinking the Search Space for Clustered Planarity
From MaRDI portal
Publication:4912193
DOI10.1007/978-3-642-36763-2_9zbMath1377.68168OpenAlexW1579848307MaRDI QIDQ4912193
Publication date: 3 April 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36763-2_9
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ Clustered planarity with pipes ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs
This page was built for publication: Shrinking the Search Space for Clustered Planarity
