Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

Bhattacharyya, B. (Bishnu) and F. Dehne (Frank)

2008-11-15

Information Processing Letters , Volume 108 - Issue 5 p. 293- 297

Additional Metadata
Keywords	Algorithms, Analysis of algorithms, Data structures
Persistent URL	dx.doi.org/10.1016/j.ipl.2008.05.023
Journal	Information Processing Letters
Organisation	School of Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bhattacharyya, B. (Bishnu), & Dehne, F. (2008). Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. Information Processing Letters, 108(5), 293–297. doi:10.1016/j.ipl.2008.05.023

Publication