Clustering Cycles into Cycles of Clusters

DOI10.7155/jgaa.00115zbMath1161.68650OpenAlexW2051084693MaRDI QIDQ5301378

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

Publication date: 19 January 2009

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

Full work available at URL: https://eudml.org/doc/55399

zbMATH Keywords

formal grammarsclustered graphsc-planarity testingdrawing algorithms also for this case

Mathematics Subject Classification ID

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

Related Items

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ Towards the Hanani-Tutte Theorem for Clustered Graphs ⋮ Clustered planarity with pipes ⋮ Clustered planarity testing revisited ⋮ A new perspective on clustered planarity as a combinatorial embedding problem ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Straight-line rectangular drawings of clustered graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Crossing minimization in perturbed drawings ⋮ Simpler algorithms for testing two-page book embedding of partitioned graphs ⋮ Strip planarity testing for embedded planar graphs ⋮ Crossing minimization in perturbed drawings ⋮ Relaxing the constraints of clustered planarity ⋮ Clustered Planarity: Clusters with Few Outgoing Edges ⋮ Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters ⋮ Bounded Embeddings of Graphs in the Plane