✦ LIBER ✦

Complexity of the path avoiding forbidden pairs problem revisited

✍ Scribed by Kováč, Jakub

Book ID: 123281960
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 476 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of paths avoiding forb

On the complexity of paths avoiding forbidden pairs

✍ Petr Kolman; Ondřej Pangrác 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 413 KB

On paths avoiding forbidden pairs of ver

On paths avoiding forbidden pairs of vertices in a graph

✍ Hananya Yinnone 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A new upper bound on the complexity of t

A new upper bound on the complexity of the all pairs shortest path problem

✍ Tadao Takaoka 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 262 KB

The Complexity of the Optimal Searcher P

The Complexity of the Optimal Searcher Path Problem

✍ K. E. Trummel and J. R. Weisinger 📂 Article 📅 1986 🏛 INFORMS 🌐 English ⚖ 590 KB

The limits of matching pairs: The “Freed

The limits of matching pairs: The “Freedman-problem” revisited

✍ Jules Peschar 📂 Article 📅 1977 🏛 Springer Netherlands 🌐 English ⚖ 948 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