Finding a longest nonnegative path in a constant degree tree

Information Processing Letters

Volumn 93, Issue 6, 2005, Pages 275-279

  Kim, Sung Kwon ^a  

^a Chung Ang University   (South Korea)

Author keywords

Algorithms; Nonnegative paths; Trees

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

BIOINFORMATICS; NONNEGATIVE PATHS; REAL NUMBERS; TIME COMPLEXITY;

TREES (MATHEMATICS);

EID: 13844275487     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.11.012     Document Type: Article

References (7)

1. L. Allison Longest biased interval and longest nonnegative sum interval Bioinformatics 9 10 2003 1294 1295
2. T.H. Coreman, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1994 MIT Press Cambridge, MA
3. A.J. Goldman Optimal center location in simple networks Transportation Science 5 1971 212 221
4. O. Kariv, and S.L. Hakimi An algorithmic approach to network location problem. I. The p-centers SIAM J. Appl. Math. 37 1979 513 538
5. D.E. Knuth Fundamental Algorithms second ed. The Art of Programming vol. 1 1973 Addison-Wesley Reading, MA
6. L. Wang, and Y. Xu SEGID: Identifying interesting segments in (multiple) sequence alignments Bioinformatics 19 2 2003 297 298
7. B.Y. Wu, K.-M. Chao, and C.Y. Tang An efficient algorithm for the length-constrained heaviest path problem on a tree Inform. Process. Lett. 69 1999 63 67