The Average Length of Paths Embedded in Trees.
Interim technical rept.,
GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUTER SCIENCE
Pagination or Media Count:
Let A sub n be defined so that the n x n array is embeddable in binary trees by dilating average path length by at most a factor of A sub n. It is shown that as n approaches infinity the limit of A sub n 0. Author
- Numerical Mathematics