2008-11-15
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
Publication
Publication
Information Processing Letters , Volume 108 - Issue 5 p. 293- 297
Additional Metadata | |
---|---|
Algorithms, Analysis of algorithms, Data structures | |
dx.doi.org/10.1016/j.ipl.2008.05.023 | |
Information Processing Letters | |
Organisation | School of Computer Science |
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
|