Detailed Information
Cited 3 time in 
Cited 4 time in 
Cited 4 time in
Metadata Downloads
Finding a longest nonnegative path in a constant degree tree
- Authors
- Kim, SK
- Issue Date
- Mar-2005
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- algorithms; nonnegative paths; trees
- Citation
- INFORMATION PROCESSING LETTERS, v.93, no.6, pp 275 - 279
- Pages
- 5
- Journal Title
- INFORMATION PROCESSING LETTERS
- Volume
- 93
- Number
- 6
- Start Page
- 275
- End Page
- 279
- ISSN
- 0020-0190
1872-6119
- Abstract
- A longest nonnegative path in an edge-weighted tree is a path such that the sum of edge weights on it is nonnegative and the number of edges on it is as large as possible. In this paper we show that if a tree has a constant degree, then its longest nonnegative path can be found in O(n log n) time, where n is the number of nodes. Previously known algorithms take O(n log(2) n) time.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.