✦ LIBER ✦

An Optimal-Time Algorithm for Shortest Paths on

✍ Scribed by Yevgeny Schreiber

Publisher: Springer
Year: 2009
Tongue: English
Weight: 917 KB
Volume: 43
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-009-9136-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Shortest Path Parallel Algori

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

An algorithm for the ranking of shortest

An algorithm for the ranking of shortest paths

✍ JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre M 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An efficient algorithm for K shortest si

An efficient algorithm for K shortest simple paths

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An O(mlog logD) algorithm for shortest p

An O(mlog logD) algorithm for shortest paths

✍ Rolf G. Karlsson; Patricio V. Poblete 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 178 KB

An optimal algorithm for shortest paths

An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications

✍ M. J. Atallah; D. Z. Chen; D. T. Lee 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 796 KB

An optimal parallel algorithm for solvin

An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

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