✦ LIBER ✦

Hu's precedence tree scheduling algorithm: A simple proof

✍ Scribed by James A. M. McHugh

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 133 KB
Volume: 31
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800310307

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum order tree algorithm for optimal

Maximum order tree algorithm for optimal scheduling of product distribution lines

✍ S. D. Mokashi; A. C. Kokossis 📂 Article 📅 2002 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 235 KB 👁 1 views

A Simple Optimal Parallel Algorithm for

A Simple Optimal Parallel Algorithm for a Core of a Tree

✍ S.T. Peng; W.T. Lo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin