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 . © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bachmaier, C., Brunner, W., & König, C. (2008). Cyclic level planarity testing and embedding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4875 LNCS, pp. 50–61). https://doi.org/10.1007/978-3-540-77537-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
