C-Planarity of C-Connected Clustered Graphs

DOI10.7155/jgaa.00165zbMath1161.68649MaRDI 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 ancestors; embedding algorithm; maximum spanning trees; counting sorts

Mathematics Subject Classification ID

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

Related Items

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