User talk:Nijibabulu

Proposed deletion of Unrooted tree path lengths

The article Unrooted tree path lengths has been proposed for deletion because of the following concern:

Unsourced and Google scholar found essentially nothing. In the unweighted case it seems likely untrue: expanding to a binary tree (with 0,1 weights), finding a central edge, using FFT to convolve the counts of distances from each side of the edge, and recursing should solve it in time something like O(n log² n). And in any case essentially no lower bounds stronger than input+output size are known for any algorithmic problem. In the case of real weights it's true but trivial because the output size is too big.

While all constructive contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing {{proposed deletion/dated}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. —David Eppstein (talk) 05:48, 7 September 2013 (UTC)