1 paper
Ce Jin, Yael Kirkpatrick, MichaÅ Stawarz +1
The All-Pairs Shortest Paths (APSP) is a foundational problem in theoretical computer science. Approximating APSP in undirected unweighted graphs has been studied for many years, b…