Abstract
We present several polynomial-time algorithms for c-planarity testing for clustered graphs with clusters of size at most three. The most general result concerns a special class of Eulerian graphs, namely graphs obtained from a fixed-size 3-connected graph by multiplying and then subdividing edges. We further give algorithms for 3-connected graphs, and for graphs with small faces. The last result applies with no restrictions on the cluster size. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Jelínková, E., Kára, J., Kratochvíl, J., Pergel, M., Suchý, O., & Vyskočil, T. (2008). Clustered planarity: Small clusters in Eulerian graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 303–314). https://doi.org/10.1007/978-3-540-77537-9_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
