Improving the cache-efficiency of shortest path search

DOI10.1007/978-3-319-67190-1_8MaRDI QIDQ5044856zbMATH OpenOpenAlexFDO

Authors Stefan Edelkamp

Publication date 2 November 2022

Published in KI 2017: Advances in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-67190-1_8

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 1617277
• A blocked all-pairs shortest-paths algorithm
• Automata, Languages and Programming

Cited in

(3)

• Improvements for the thresh X2 shortest path algorithm
• scientific article; zbMATH DE number 1670814 (Why is no real title available?)
• A performance study of data layout techniques for improving data locality in refinement-based pathfinding

This page was built for publication: Improving the cache-efficiency of shortest path search

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