✦ LIBER ✦

On the Expected Performance of Path Compression Algorithms

✍ Scribed by Yao, Andrew C.

Book ID: 118174110
Publisher: Society for Industrial and Applied Mathematics
Year: 1985
Tongue: English
Weight: 667 KB
Volume: 14
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0214010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Expected Performance of Branch-An

On the Expected Performance of Branch-And-Bound Algorithms

✍ J. K. Lenstra and A. H. G. Rinnooy Kan 📂 Article 📅 1978 🏛 INFORMS 🌐 English ⚖ 144 KB

A theorem on the expected complexity of

A theorem on the expected complexity of dijkstra's shortest path algorithm

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Two-dimensional packing: expected perfor

Two-dimensional packing: expected performance of simple level algorithms

✍ Micha Hofri 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 729 KB

On the expected behaviors of the Dijkstr

On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs

✍ Kohei Noshita; Etsuo Masuda; Hajime Machida 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

Worst-case performance of critical path

Worst-case performance of critical path type algorithms

✍ G. Singh; Y. Zinder 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

Worst-case performance of critical path

Worst-case performance of critical path type algorithms

✍ G. Singh; Y. Zinder 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 343 KB

The critical path method remains one of the most popular approaches in practical scheduling. Being developed for the makespan problem this method can also be generalized to the maximum lateness problem. For the unit execution time task system and parallel processors this generalization is known as t