Clustered Planarity: Clusters with Few Outgoing Edges

Jelínek, Vít and Suchý, Ondrej and Tesar, Marek and Vyskocil, Tomás (2009) Clustered Planarity: Clusters with Few Outgoing Edges. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 102-113(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_11).

Full text not available from this repository.

Abstract

We present a linear algorithm for c-planarity testing of clustered graphs, in which every cluster has at most four outgoing edges.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_11
Classifications: G Algorithms and Complexity > G.350 Clusters
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/900

Actions (login required)

View Item View Item