Cache-oblivious priority queue and graph algorithm applications
From MaRDI portal
Publication:3579229
DOI10.1145/509907.509950zbMath1192.68166OpenAlexW2022117185MaRDI QIDQ3579229
Erik D. Demaine, Lars Arge, J. Ian Munro, Bryan Holland-Minkley, Michael A. Bender
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.2587
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (6)
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing ⋮ Unnamed Item ⋮ New method in information processing for maintaining an efficient dynamic ordered set ⋮ Designing reliable algorithms in unreliable memories ⋮ Cache-oblivious R-trees ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs
This page was built for publication: Cache-oblivious priority queue and graph algorithm applications
