C-Planarity of C-Connected Clustered Graphs

DOI10.7155/jgaa.00165zbMath1161.68649OpenAlexW2100766141MaRDI QIDQ5301436

Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Pizzonia, Fabrizio Frati, Maurizio Patrignani

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2008/Cortese+2008.12.2.pdf

zbMATH Keywords

lowest common ancestorsembedding algorithmmaximum spanning treescounting sorts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (17)

Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Clustered planarity with pipes ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Clustered planarity testing revisited ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Computing NodeTrix Representations of Clustered Graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Embedding graphs into embedded graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Relaxing the constraints of clustered planarity ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Bounded Embeddings of Graphs in the Plane ⋮ Beyond Clustered Planar Graphs ⋮ Embedding Graphs into Embedded Graphs

This page was built for publication: C-Planarity of C-Connected Clustered Graphs