Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sung Kwon Kim. Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths. IEICE Transactions, 96-D(3):498-501, 2013. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge LengthsSung Kwon Kim. ieicet, 98-D(1):103-107, 2015. [doi] Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a TreeSung Kwon Kim. ieicet, 93-D(11):2989-2994, 2010. [doi]
The following publications are possibly variants of this publication: