✦ LIBER ✦

Optimal parallel algorithm for shortest-paths problem on interval graphs

✍ Scribed by P. K. Mishra

Book ID: 111840037
Publisher: SP Zhejiang University Press
Year: 2004
Tongue: English
Weight: 688 KB
Volume: 5
Category: Article
ISSN: 1009-3095
DOI: 10.1631/jzus.2004.1135

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 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

An optimal algorithm to solve the all-pa

An optimal algorithm to solve the all-pair shortest path problem on interval graphs

✍ R. Ravi; Madhav V. Marathe; C. Pandu Rangan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

Linear algorithm for optimal path cover

Linear algorithm for optimal path cover problem on interval graphs

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Parallel Algorithms for Dynamic Shortest

Parallel Algorithms for Dynamic Shortest Path Problems

✍ Ismail Chabini; Sridevi Ganugapati 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 174 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