All-pairs bottleneck paths for general graphs in truly sub-cubic time

In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can be routed from s to t. The APBP problem was first stud

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Virginia Vassilevska, Ryan Williams, Raphael Yuster
• Keywords: Algorithms, APBP Problem, Maximum Capacity Paths, Real Non-negative Capacities, STOC 2007