Priority queues with update and finding minimum spanning trees
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
A note on two problems in connexion with graphs
1959 • 22,492 citations
The Art of Computer Programming
1968 • 16,727 citations
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
The Art of Computer Programming
1970 • 6,773 citations
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
The Art of Computer Programming: Volume 3: Sorting and Searching
1973 • 4,126 citations
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
1975 • 157 citations
Computing minimum spanning trees efficiently
1972 • 72 citations
Computational complexity of random access stored program machines
1971 • 45 citations
On shortest paths and sorting
1972 • 41 citations
Algorithms for shortest paths.
1973 • 27 citations