Presentation
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
16th International Symposium on Graph Drawing (GD 2008)
(2008)
Abstract
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
Disciplines
Publication Date
2008
Location
Heraklion, Crete, Greece
DOI
10.1007/978-3-642-00219-9_13
Comments
The final publication is available at Springer via https://doi.org/10.1007/978-3-642-00219-9_13. Jelínek, Vít, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, "Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)," 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Graph Drawing, Lecture Notes in Computer Science 5417 (2009): 121-132 Posted with permission. Copyright 2009 Springer-Verlag Berlin Heidelberg
Citation Information
Vít Jelínek, Eva Jelínková, Jan Kratochvíl and Bernard Lidicky. "Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters" 16th International Symposium on Graph Drawing (GD 2008) (2008) Available at: http://works.bepress.com/bernard-lidicky/29/