Browse > Article

Sequential and Parallel Algorithms for Finding a Longest Non-negative Path in a Tree  

Kim, Sung-Kwon (중앙대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.33, no.12, 2006 , pp. 880-884 More about this Journal
Abstract
In an edge-weighted(positive, negative, or zero weights are possible) tree, we want to solve the problem of finding a longest path such that the sum of the weights of the edges in tile path is non-negative. To find a longest non-negative path of a tree we present a sequential algorithm with O(n logn) time and a CREW PRAM parallel algorithm with $O(log^2n)$ time and O(n) processors. where n is the number of nodes in the tree.
Keywords
trees; non-negative paths; sequential and parallel algorithms;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D.E. Knuth, The Art of Programming, Vol. 1. Fundamental Algorithms, 2nd Edition, Addison-Wesley, 1973
2 H. Shen, Fast parallel algorithm for finding kth longest path in a tree, Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), IEEE, pp. 164-169, 1997   DOI
3 J. JaJa, An Introduction to Parallel Algorithms, Addison-Wesley, 1992
4 S.K. Kim, Finding a longest nonnegative path in a constant degree tree, Information Processing Letters, vol. 93, no. 6, pp. 275-279, March 2005   DOI   ScienceOn
5 L. Allison, Longest biased intervals and longest non-negative sum intervals, Bioinformatics, vol. 19(10), pp. 1294-1295, 2003   DOI   ScienceOn
6 B.Y. Wu, K.-M. Chao, and C.Y. Tang, An efficient algorithm for the length-constrained heaviest path problem on a tree, Information Processing Letters, vol. 69, pp. 63-67, 1999   DOI   ScienceOn
7 L. Wang and Y. Xu, SEGID: Identifying interesting segments in (multiple) sequence alignments, Bioinformatics, vol. 19(2), pp. 297-298, 2003   DOI   ScienceOn