Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces

Authors

Giuseppe Di Battista
Fabrizio Frati

DOI:

Abstract

LetC be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing thec-planarity ofC easier thanin the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterizec-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorithm for such graphs. The resultsare based on a more general methodology that sheds new light on thec-planarity testing problem.

Downloads

Download data is not yet available.

Downloads

article (PDF)

Published

2009-11-01

How to Cite

Di Battista, G., & Frati, F. (2009). Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.Journal of Graph Algorithms and Applications,13(3), 349–378. https://doi.org/10.7155/jgaa.00191