6.854J | Fall 2008 | Graduate

Advanced Algorithms

Lecture Notes

Fibonacci heaps

Description:

Lecture notes on Fibonacci heaps, a data structure that provides a very efficient implementation of a priority queue.

Resource Type:
Lecture Notes

Course Info

As Taught In
Fall 2008
Level
Learning Resource Types
Lecture Notes
Problem Sets with Solutions