✦ LIBER ✦

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

✍ Scribed by Yijie Han; V. Y. Pan; J. H. Reif

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

More Algorithms for All-Pairs Shortest P

✍ Chan, Timothy M. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 KB

Faster Algorithms for All-pairs Approxim

✍ Baswana, Surender; Kavitha, Telikepalli 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 526 KB

An optimal parallel algorithm for solvin

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

An efficient VLSI algorithm for the all

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Efficient Algorithms for Shortest Paths

✍ Johnson, Donald B. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 833 KB

A sharper analysis of a parallel algorit

✍ Qian Ping Gu; Tadao Takaoka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 457 KB