Splitting Clusters to Get C-Planarity

DOI10.1007/978-3-642-11805-0_8zbMath1284.68441OpenAlexW1598927029MaRDI QIDQ3557871

Patrizio Angelini, Maurizio Patrignani, Fabrizio Frati

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-11805-0_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Relaxing the constraints of clustered planarity

This page was built for publication: Splitting Clusters to Get C-Planarity