Strict fibonacci heaps
From MaRDI portal
Publication:5415543
DOI10.1145/2213977.2214082zbMath1286.68100DBLPconf/stoc/BrodalLT12OpenAlexW1968886089WikidataQ55868915 ScholiaQ55868915MaRDI QIDQ5415543
Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214082
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (10)
Dynamic layers of maxima with applications to dominating queries ⋮ Hollow Heaps ⋮ A new model and algorithms in firefighting theory ⋮ Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times ⋮ A faster computation of all the best swap edges of a shortest paths tree ⋮ Shortest distances as enumeration problem ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Multi-level spectral graph partitioning method ⋮ Quantum algorithm for shortest path search in directed acyclic graph ⋮ A Survey on Priority Queues
This page was built for publication: Strict fibonacci heaps
