Skip to main content
Conference ProceedingsOPEN ACCESS

Clustered planarity: Embedded clustered graphs with two-component clusters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5417 LNCS 121-132
DOI: 10.1007/978-3-642-00219-9_13
25Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jelínek, V., Jelínková, E., Kratochvíl, J., & Lidický, B. (2009). Clustered planarity: Embedded clustered graphs with two-component clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 121–132). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free