R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks

DOI10.1007/s00453-006-1224-zzbMath1108.68124OpenAlexW2020545624MaRDI QIDQ870454

Alexandru Nicolau, Paolo D'Alberto

Publication date: 12 March 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-1224-z

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation ⋮ Solving path problems on the GPU

Uses Software

• ATLAS

This page was built for publication: R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks