Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMATH Open1095.68572OpenAlexW2615963353MaRDI QIDQ5315399FDOQ5315399

Authors: Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh 

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Recommendations

• Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
• 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (10)

• Automata, Languages and Programming
• A Survey on Priority Queues
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Optimal cache-oblivious mesh layouts
• Via Detours to I/O-Efficient Shortest Paths
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Title not available (Why is that?)
• Cache Oblivious Minimum Cut
• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths

This page was built for publication: Algorithm Theory - SWAT 2004

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