✦ LIBER ✦

NC algorithms for dynamically solving the all pairs shortest paths problem and related problems

✍ Scribed by Weifa Liang; Brendan D. McKay; Hong Shen

Book ID: 107766307
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 728 KB
Volume: 58
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00037-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subcubic Cost Algorithms for the All Pai

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

✍ T. Takaoka 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 95 KB

An efficient VLSI algorithm for the all

An efficient VLSI algorithm for the all pairs shortest path problem

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 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

An Optimal Algorithm to Solve the All-Pa

An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs

✍ Sukumar Mondal; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 89 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

Solving the all-pair shortest path query

Solving the all-pair shortest path query problem on interval and circular-arc graphs

✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently