C-Planarity of C-Connected Clustered Graphs

DOI10.7155/JGAA.00165MaRDI QIDQ5301436zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

counting sortsembedding algorithmlowest common ancestorsmaximum spanning trees

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

(27)

• 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
• A new perspective on clustered planarity as a combinatorial embedding problem
• Straight-Line Rectangular Drawings of Clustered Graphs
• Efficient C-planarity testing for embedded flat clustered graphs with small faces
• Splitting clusters to get c-planarity
• Clustered Planarity: Clusters with Few Outgoing Edges
• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• 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
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Graph Drawing
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Straight-line rectangular drawings of clustered graphs
• A note on obstructions to clustered planarity
• Constrained planarity in practice -- engineering the synchronized planarity algorithm
• Exact algorithms for clustered planarity with linear saturators
• Clustered planarity testing revisited
• A new perspective on clustered planarity as a combinatorial embedding problem

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)