Sharing information for the all pairs shortest path problem
From MaRDI portal
Publication:391758
DOI10.1016/j.tcs.2013.09.006zbMath1358.05288MaRDI QIDQ391758
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.006
priority queue; information sharing; all pairs shortest path problem; limited edge cost; nearly acyclic graph; single sink shortest path problem
68W40: Analysis of algorithms
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Uses Software
