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 ( n log n ) time algorithm, which improves the previously best result of O ( n log 2 n ) by using centroid decomposition. We also show the time complexity is optimal in the algebraic computation tree model.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
