Arrow Research search
Back to SODA

SODA 1999

A Near-Linear Area Bound for Drawing Binary Trees

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM-SIAM Symposium on Discrete Algorithms
Archive span
1990-2025
Indexed papers
4674
Paper id
1033558350972174745