| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428021 | Information Processing Letters | 2009 | 5 Pages |
Abstract
We studied the problem of finding the maximum-density path in a tree. By spine decomposition and a linear-time algorithm for the maximum density segment problem, we developed an O(nlogn) time algorithm, which improves the previously best result of O(nlog2n) by using centroid decomposition. We also show the time complexity is optimal in the algebraic computation tree model.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
