Find out how to access preview-only content
Combinatorics and Computer Science
Volume 1120 of the series Lecture Notes in Computer Science pp 234-243
Date:
Optimum alphabetic binary trees
- T. C. HuAffiliated withDepartment of Computer Science and Engineering, School of Engineering, University of California
- , J. D. MorgenthalerAffiliated withDepartment of Computer Science and Engineering, School of Engineering, University of California
Abstract
We describe a modification of the Hu-Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.
- Title
- Optimum alphabetic binary trees
- Book Title
- Combinatorics and Computer Science
- Book Subtitle
- 8th Franco-Japanese and 4th Franco-Chinese Conference Brest, France, July 3–5, 1995 Selected Papers
- Pages
- pp 234-243
- Copyright
- 1996
- DOI
- 10.1007/3-540-61576-8_86
- Print ISBN
- 978-3-540-61576-7
- Online ISBN
- 978-3-540-70627-4
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 1120
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
- Authors
-
- T. C. Hu (1)
- J. D. Morgenthaler (1)
- Author Affiliations
-
- 1. Department of Computer Science and Engineering, School of Engineering, University of California, 92093-0114, San Diego, CA, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.