The Average Length of Paths Embedded in Trees.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1977
Accession Number
ADA051994

Entities

People

  • Richard A. Demillo
  • Richard J. Lipton

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Computer Science
  • Computers
  • Digital Information
  • Embedding
  • Numbers
  • Real Numbers
  • Schools
  • Trees (Data Structures)

Fields of Study

  • Mathematics