A branch-checking algorithm for all-pairs shortest paths

DOI10.1007/S00453-004-1122-1zbMath1082.68121OpenAlexW2053609728MaRDI QIDQ1763152

Cees W. 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

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

Related Items (1)

Two fast algorithms for all-pairs shortest paths

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