All-pairs bottleneck paths in vertex weighted graphs

zbMATH Open1302.05196MaRDI QIDQ2934690FDOQ2934690

Authors: Asaf Shapira, Raphael Yuster, Uri Zwick 

Publication date: 18 December 2014

Recommendations

• All-pairs bottleneck paths in vertex weighted graphs
• Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
• scientific article; zbMATH DE number 5899282
• Some extensions of the bottleneck paths problem
• More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Cited In (12)

• Combining all pairs shortest paths and all pairs bottleneck paths problems
• Bottleneck flows in unit capacity networks
• Variations on the bottleneck paths problem
• Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
• Some extensions of the bottleneck paths problem
• Efficient all path score computations on grid graphs
• Transitive blocks and their applications in fuzzy interconnection networks
• A fast output-sensitive algorithm for Boolean matrix multiplication
• All-pairs bottleneck paths in vertex weighted graphs
• Single-source bottleneck path algorithm faster than sorting for sparse graphs
• On minimum witnesses for Boolean matrix multiplication
• On Cartesian trees and range minimum queries

This page was built for publication: All-pairs bottleneck paths in vertex weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934690)