Finding a Length-Constrained Maximum-Density Path in a Tree

Rung-Ren Lin, Wen-Hsiung Kuo and Kun-Mao Chao ()
Additional contact information
Rung-Ren Lin: National Taiwan University
Wen-Hsiung Kuo: National Taiwan University
Kun-Mao Chao: National Taiwan University

Journal of Combinatorial Optimization, 2005, vol. 9, issue 2, No 1, 147-156

Abstract: Abstract Let T = (V,E,w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2,..., e k , is defined as ∑ k i = 1 w(e i )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-density path of length at least L in O(nL) time. One of them is further modified to solve some special cases such as full m-ary trees in O(n) time.

Keywords: algorithm; computational biology; network design; tree (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-6853-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6853-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-6853-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().