✦ LIBER ✦

Recursive weighted treelike networks

✍ Scribed by Zhongzhi Zhang; Shuigeng Zhou; Lichao Chen; Jihong Guan; Lujun Fang; Yichao Zhang

Book ID: 111622351
Publisher: Springer
Year: 2007
Tongue: English
Weight: 279 KB
Volume: 59
Category: Article
ISSN: 1434-6036
DOI: 10.1140/epjb/e2007-00264-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simple multistage location problem on a

Simple multistage location problem on a treelike network

✍ V. A. Trubin; F. A. Sharifov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 413 KB

Diagnosis of fatigue crack growth with r

Diagnosis of fatigue crack growth with recursive random weight networks

✍ Zhou, Zhenghua; Zhao, Jianwei; Cao, Feilong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Generalized Recursive Sorting Networks

✍ T.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Quadratically hyponormal weighted shifts

Quadratically hyponormal weighted shifts with recursive tail

✍ Exner, George R.; Jung, Il Bong; Lee, Mi Ryeong; Park, Sun Hyun 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Weighted Evolving Networks

✍ Yook, S. H.; Jeong, H.; Barabási, A.-L.; Tu, Y. 📂 Article 📅 2001 🏛 The American Physical Society 🌐 English ⚖ 214 KB

Mean flow scheduling and optimal constru

Mean flow scheduling and optimal construction of a treelike communication network

✍ Yehoshua Perl; Yaacov Yesha 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

## Abstract Horn's algorithm for weighted mean flow scheduling with treelike precedence constraints is reexamined. A new analysis of an efficient implementation of Horn's algorithm shows an __O(n__ log __n)__ complexity. This is an improvement on the known __O(n^2^)__ complexity of this algorithm.