Algorithm Theory - SWAT 2004

From MaRDI portal

Revision as of 22:23, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5315399

Jump to:navigation, search

DOI10.1007/B98413zbMath1095.68572OpenAlexW2615963353MaRDI QIDQ5315399

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

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

Mathematics Subject Classification ID

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

Related Items (7)

Cache Oblivious Minimum Cut ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Optimal cache-oblivious mesh layouts ⋮ Unnamed Item ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ A Survey on Priority Queues

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5315399&oldid=19988979"