All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
From MaRDI portal
Publication:3189076
DOI10.1145/2344422.2344424zbMath1295.05224OpenAlexW2623150993MaRDI QIDQ3189076
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2344422.2344424
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Dynamic Set Intersection ⋮ Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Intensity estimation on geometric networks with penalized splines ⋮ A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs ⋮ Shortest distances as enumeration problem ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ Unnamed Item ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths
This page was built for publication: All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
