Thin heaps, thick heaps

The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in practice as other heap implementations. Expanding on ideas of H

• Type: Journal
• Year: 2008
• Where: TALG
• Authors: Haim Kaplan, Robert Endre Tarjan
• Keywords: Computer Science, Fibonacci Heap, Heap Implementations, TALG 2008