Journal ArticleOPEN ACCESS

Area-Efficient Drawings of Outerplanar Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2912 129-134
DOI: 10.1007/978-3-540-24595-7_12
8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn1.48) in O(n) time. This implies that if d = o(n0.52), then G can be drawn in this fashion in o(n2) area. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Garg, A., & Rusu, A. (2004). Area-Efficient Drawings of Outerplanar Graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 129–134. https://doi.org/10.1007/978-3-540-24595-7_12

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