Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ALGORITHMICA

2011

2011

Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function deﬁned on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), is the maximum bottleneck weight of a path from u to v. In the All-Pairs Bottleneck Paths (APBP) problem we have to ﬁnd the bottleneck weights for all ordered pairs of vertices. Our main result is an O(n2.575 ) time algorithm for the APBP problem. The exponent is derived from the exponent of fast matrix multiplication. Our algorithm is the ﬁrst sub-cubic algorithm for this problem. Unlike the sub-cubic algorithm for the all-pairs shortest paths (APSP) problem, that only applies to bounded (or relatively small) integer edge or vertex weights, the algorithm presented for APBP problem works for arbitrary large vertex weights. The APBP problem has numerous applications, and several int...

Related Content

Added |
12 May 2011 |

Updated |
12 May 2011 |

Type |
Journal |

Year |
2011 |

Where |
ALGORITHMICA |

Authors |
Asaf Shapira, Raphael Yuster, Uri Zwick |

Comments (0)