A branch-checking algorithm for all-pairs shortest paths

DOI10.1007/S00453-004-1122-1MaRDI QIDQ1763152zbMATH OpenOpenAlexFDO

Authors Cees Duin

Publication date 21 February 2005

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1122-1

zbMATH Keywords

undirected graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Two fast algorithms for all-pairs shortest paths
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• Shortest path methods: A unifying approach
• A new approach to dynamic all pairs shortest paths
• scientific article; zbMATH DE number 219247

Cited in

(3)

• Two fast algorithms for all-pairs shortest paths
• Solving the nearly symmetric all-pairs shortest-path problem
• A two-criterion lexicographic algorithm for finding all shortest paths in networks

This page was built for publication: A branch-checking algorithm for all-pairs shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763152)