Sciweavers

96 search results - page 20 / 20
» Alpha-Beta Witness Complexes
Sort
View
ALGORITHMICA
2011
13 years 9 days ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick