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.
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang. An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. Inf. Process. Lett., 69(2):63-67, 1999. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysisYaw-Ling Lin, Tao Jiang, Kun-Mao Chao. jcss, 65(3):570-586, 2002. [doi] Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence AnalysisYaw-Ling Lin, Tao Jiang, Kun-Mao Chao. mfcs 2002: 459-470 [doi]
The following publications are possibly variants of this publication: