Sciweavers

ISAAC
2003
Springer
95views Algorithms» more  ISAAC 2003»
14 years 5 months ago
Finding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao