Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs

DOI10.1145/3147172MaRDI QIDQ4554946zbMATH OpenOpenAlexFDO

Authors Vijaya Ramachandran, Rezaul Alam Chowdhury

Publication date 12 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3147172

zbMATH Keywords

buffer heapcache-efficientcache-obliviousdecrease-keypriority queueshortest paths

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithm Theory - SWAT 2004
• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1979501

Cited in

(6)

• A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
• Improving the cache-efficiency of shortest path search
• External memory priority queues with decrease-key and applications to graph algorithms
• Algorithm Theory - SWAT 2004
• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• Automata, Languages and Programming

This page was built for publication: Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs

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