Variations on the bottleneck paths problem

DOI10.1016/j.tcs.2014.10.049zbMath1310.05127OpenAlexW2009486499MaRDI QIDQ2339446

Tong-Wook Shinn, Tadao Takaoka

Publication date: 1 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.049

zbMATH Keywords

graph algorithmshortest pathsbottleneck pathsAPBPAPSP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time

Cites Work

• A note on two problems in connexion with graphs
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
• Multiplying matrices faster than coppersmith-winograd
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Variations on the bottleneck paths problem