Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Chimani, Markus and Di Battista, Giuseppe and Frati, Fabrizio and Klein, Karsten (2014) Advances on Testing C-Planarity of Embedded Flat Clustered Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 416-427(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_35).

Full text not available from this repository.

Abstract

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-662-45803-7_35
Classifications: G Algorithms and Complexity > G.350 Clusters
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.180 Cluster
P Styles > P.540 Planar
Z Theory > Z.750 Topology
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 22 May 2015 12:48
Last Modified: 16 Feb 2016 13:17
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1451

Actions (login required)

View Item View Item