Finding a longest nonnegative path in a constant degree tree

Authors:
Sung Kwon Kim
Affiliations:
Department of Computer Engineering, Chung-Ang University, 221 Huksuk-dong Dongjak-ku, Seoul 156-756, Republic of Korea
Venue:
Information Processing Letters
Year:
2005

Citing 2
Cited 2

Introduction to algorithms

Introduction to algorithms
An efficient algorithm for the length-constrained heaviest path problem on a tree

Information Processing Letters

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

Information Processing Letters
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence

Theoretical Computer Science

Quantified Score

Hi-index	0.91

Visualization

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 log2 n) time.