Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems

DOI10.1007/978-3-642-54423-1_20zbMath1405.68254arXiv1309.5687OpenAlexW66906462MaRDI QIDQ5405042

Tong-Wook Shinn, Tadao Takaoka

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.5687

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (6)

A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Unnamed Item ⋮ Algebraic theory on shortest paths for all flows ⋮ Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ Variations on the bottleneck paths problem

This page was built for publication: Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems