Algebraic theory on shortest paths for all flows

DOI10.1016/j.tcs.2016.08.007zbMath1423.68357OpenAlexW2541192013MaRDI QIDQ2424883

Tadao Takaoka

Publication date: 25 June 2019

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

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

zbMATH Keywords

priority queueinformation sharinglimited edge costshortest path problem for all flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Sharing information for the all pairs shortest path problem
• Approximation algorithms for the unsplittable flow problem
• On the single-source unsplittable flow problem
• On the exponent of all pairs shortest path problem
• Subcubic cost algorithms for the all pairs shortest path problem
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• Algorithms for two bottleneck optimization problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Multicriteria Optimization
• Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
• Some Extensions of the Bottleneck Paths Problem