C-Planarity of C-Connected Clustered Graphs

DOI10.7155/JGAA.00165MaRDI QIDQ5301436zbMATHOpenAlexFDO

Authors Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, 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 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)

Recommendations

• scientific article; zbMATH DE number 1974122
• Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
• Planarity for clustered graphs
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• A new perspective on clustered planarity as a combinatorial embedding problem

Cited in

(25)

• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• Synchronized Planarity with Applications to Constrained Planarity Problems
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Advances on testing C-planarity of embedded flat clustered graphs
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Straight-Line Rectangular Drawings of Clustered Graphs
• Graph Drawing
• Clustered planarity = flat clustered planarity
• Clustered planarity with pipes
• Straight-line rectangular drawings of clustered graphs
• Beyond Clustered Planar Graphs
• Clustered planarity testing revisited
• Embedding Graphs into Embedded Graphs
• Splitting clusters to get c-planarity
• Relaxing the constraints of clustered planarity
• Embedding graphs into embedded graphs
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Bounded Embeddings of Graphs in the Plane
• A new perspective on clustered planarity as a combinatorial embedding problem
• Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
• A new perspective on clustered planarity as a combinatorial embedding problem
• Clustered Planarity: Clusters with Few Outgoing Edges
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• A note on obstructions to clustered planarity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301436)