Skip to main content
Conference ProceedingsOPEN ACCESS

Planarization of clustered graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2265 LNCS 60-74
DOI: 10.1007/3-540-45848-4_5
34Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Di Battista, G., Didimo, W., & Marcandalli, A. (2002). Planarization of clustered graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2265 LNCS, pp. 60–74). Springer Verlag. https://doi.org/10.1007/3-540-45848-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free