Finding a longest nonnegative path in a constant degree tree

DOI10.1016/J.IPL.2004.11.012zbMath1173.68608OpenAlexW2071441155MaRDI QIDQ835050

Sung Kwon Kim

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.012

zbMATH Keywords

algorithmstreesnonnegative paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

Uses Software

• SEGID

Cites Work

• Unnamed Item
• An efficient algorithm for the length-constrained heaviest path problem on a tree
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers

This page was built for publication: Finding a longest nonnegative path in a constant degree tree