✦ LIBER ✦

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

✍ Scribed by Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine

Book ID: 123513469
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 311 KB
Volume: 471
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.10.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharing information for the all pairs sh

Sharing information for the all pairs shortest path problem

✍ Takaoka, Tadao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 236 KB

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

More Algorithms for All-Pairs Shortest P

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

✍ Chan, Timothy M. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 251 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

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