Unrooted tree path lengths

From Wikipedia, the free encyclopedia

This article does not cite any references or sources. (February 2008) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.

This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (November 2006)

In computer science, the problem of unrooted tree path lengths is that of finding the number of paths of each length in a tree.

It is known that no algorithm can solve it in less than O(n²) asymptotic time.^{[citation needed]}