External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue

DOI10.1007/978-3-642-32241-9_31zbMath1364.68149OpenAlexW20119472MaRDI QIDQ2914341

Sajith Gopalan, Alka Bhushan

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_31

zbMATH Keywords

priority queuedata structureI/Oexternal memory data structure

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

An I/O Efficient Algorithm for Minimum Spanning Trees ⋮ I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs

This page was built for publication: External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue