Theory of 2-3 heaps

DOI10.1016/S0166-218X(02)00219-6zbMath1011.68023MaRDI QIDQ1861570

Tadao Takaoka

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Fibonacci heap2-3 heap

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (7)

Hollow Heaps ⋮ Replacing Mark Bits with Randomness in Fibonacci Heaps ⋮ Partial Solution and Entropy ⋮ Revisiting priority queues for image analysis ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP ⋮ Quake Heaps: A Simple Alternative to Fibonacci Heaps

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Faster algorithms for the shortest path problem
• A data structure for manipulating priority queues
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Theory of 2-3 heaps