✦ LIBER ✦

The all-pairs quickest path problem

✍ Scribed by D.T. Lee; E. Papadopoulou

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 625 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90214-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The quickest path problem

✍ Y.L. Chen; Y.H. Chin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 822 KB

On the quickest path problem

✍ Gen-Huey Chen; Yung-Chen Hung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Distributed algorithms for the quickest

Distributed algorithms for the quickest path problem

✍ Yung-Chen Hung; Gen-Huey Chen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 955 KB

On the Exponent of the All Pairs Shortes

On the Exponent of the All Pairs Shortest Path Problem

✍ Noga Alon; Zvi Galil; Oded Margalit 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

The upper bound on the exponent, |, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for t

On the All-Pairs-Shortest-Path Problem i

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

✍ R. Seidel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 318 KB

We present an algorithm, APD, that solves the distance version of the all-pairs-shortest-path problem for undirected, unweighted \(n\)-vertex graphs in time \(O(M(n) \log n)\), where \(M(n)\) denotes the time necessary to multiply two \(n \times n\) matrices of small integers (which is currently kno

All-Pairs Small-Stretch Paths

✍ Edith Cohen; Uri Zwick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Let G = (V, E) be a weighted undirected graph. A path between a,v E V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding small-stretch paths between all pairs of vertices in the graph G.It is easy to see that find