✦ LIBER ✦

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

✍ Scribed by Rung-Ren Lin; Wen-Hsiung Kuo; Kun-Mao Chao

Book ID: 106407002
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 152 KB
Volume: 9
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-005-6853-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for finding a leng

An improved algorithm for finding a length-constrained maximum-density subtree in a tree

✍ Hsin-Hao Su; Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An optimal algorithm for the maximum-den

An optimal algorithm for the maximum-density path in a tree

✍ Bang Ye Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Finding a longest nonnegative path in a

Finding a longest nonnegative path in a constant degree tree

✍ Sung Kwon Kim 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 100 KB

An optimal time algorithm for finding a

An optimal time algorithm for finding a maximum weight independent set in a tree

✍ G. H. Chen; M. T. Kuo; J. P. Sheu 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 147 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

Left and Right Length of Paths in Binary

Left and Right Length of Paths in Binary Trees or on a Question of Knuth

✍ Alois Panholzer 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 333 KB