Abstract
We show that every c-planar clustered graph admits a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006]. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Angelini, P., Frati, F., & Kaufmann, M. (2009). Straight-line rectangular drawings of clustered graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5664 LNCS, pp. 25–36). https://doi.org/10.1007/978-3-642-03367-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free