The Violation Heap: A Relaxed Fibonacci-Like Heap

Details The Violation Heap: A Relaxed Fibonacci-Like Heap The Violation Heap: A Relaxed Fibonacci-Like Heap

2008-12-15

arxiv.org/abs/0812.2851v2

Computer Science

Data Structures and Algorithms

10 pages

Scientific paper

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires $O(\log n)$ amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure.

Affiliated with

Also associated with

No associations

Rating

The Violation Heap: A Relaxed Fibonacci-Like Heap does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Violation Heap: A Relaxed Fibonacci-Like Heap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Violation Heap: A Relaxed Fibonacci-Like Heap will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349575