Cyclic Level Planarity Testing and Embedding

Bachmaier, Christian and Brunner, Wolfgang and König, Christof (2008) Cyclic Level Planarity Testing and Embedding. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 50-61(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_8).

Full text not available from this repository.

Abstract

In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama et al. [8] and the cyclic extension of level planar graphs, where the first level is the successor of the last level. We study the testing and embedding problem and solve it for strongly connected graphs in time $O(|V| log |V|)$.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-77537-9_8
Classifications: M Methods > M.500 Layered
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/828

Actions (login required)

View Item View Item