Computing and Combinatorics
From MaRDI portal
Publication:4681187
DOI10.1007/b99243zbMath1091.68082OpenAlexW2491887524MaRDI QIDQ4681187
Publication date: 15 June 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99243
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem ⋮ All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time ⋮ Algebraic methods in the congested clique ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ The Floyd-Warshall algorithm on graphs with negative cycles ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths
