Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
A data structure for manipulating priority queues
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Theory With Applications
Graph Theory With Applications
Improved shortest path algorithms for nearly acyclic directed graphs
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
ACM Transactions on Algorithms (TALG)
Revisiting priority queues for image analysis
Pattern Recognition
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
SIAM Journal on Computing
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.00 |
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports n insert, n delete-min, and m decrease-key operations in O(m + n log n) time. Our experiments show the 2-3 heap is more efficient. The new data structure will have a wide application in graph algorithms.