✦ LIBER ✦

Sharing information for the all pairs shortest path problem

✍ Scribed by Takaoka, Tadao

Book ID: 123044889
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 236 KB
Volume: 520
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.09.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A priority queue for the all pairs short

A priority queue for the all pairs shortest path problem

✍ Alistair Moffat; Tadao Takaoka 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 410 KB

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

More effective crossover operators for t

More effective crossover operators for the all-pairs shortest path problem

✍ Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madel 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 311 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

A Note on Spira’s Algorithm for the All-

A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem

✍ Carson, John S.; Law, Averill M. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 327 KB