Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

DOI10.1007/978-3-662-45803-7_35zbMath1426.68204OpenAlexW2103563552MaRDI QIDQ2936949

Markus Chimani, Karsten Klein, Fabrizio Frati, Giuseppe Di Battista

Publication date: 7 January 2015

Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45803-7_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Computing NodeTrix Representations of Clustered Graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Strip planarity testing for embedded planar graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Embedding Graphs into Embedded Graphs

This page was built for publication: Advances on Testing C-Planarity of Embedded Flat Clustered Graphs