Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
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
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Efficient algorithms for solving shortest paths on nearly acyclic directed graphs
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Solving shortest paths efficiently on nearly acyclic directed graphs
Theoretical Computer Science
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Research paper: The saga of minimum spanning trees
Computer Science Review
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.01 |
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key and insert operations, and n delete-min operations in O(m + n log n) time. The merit of the 2-3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in graph algorithms.