scientific article; zbMATH DE number 5485494

MaRDI QIDQ3549658zbMATH OpenFDO

Authors Raphael Yuster, Virginia Vassilevska Williams, Ryan Williams

Publication date 5 January 2009

zbMATH Keywords

all-pairs bottleneck paths problemall-pairs maximum capacity paths problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Flows in graphs (05C21) Paths and cycles (05C38)

Cited in

(9)

• Bottleneck flows in unit capacity networks
• Quadratic bottleneck problems
• Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• All-pairs bottleneck paths in vertex weighted graphs
• Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
• Single-source bottleneck path algorithm faster than sorting for sparse graphs
• On efficient algorithms for bottleneck path problems with many sources
• On Cartesian trees and range minimum queries

This page was built for publication:

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