Skip to main content
Journal Article

Symmetric layout of disconnected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2906 405-414
DOI: 10.1007/978-3-540-24587-2_42
11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a linear time algorithm for drawing disconnected planar graphs with maximum number of symmetries. Our algorithm can be generalized to making symmetric arrangements of bounded disjoint objects in the plane. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Hong, S. H., & Eades, P. (2003). Symmetric layout of disconnected graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2906, 405–414. https://doi.org/10.1007/978-3-540-24587-2_42

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