Fast probabilistic algorithms for hamiltonian circuits and matchings
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
An introduction to probability theory and its applications
1958 • 31,109 citations
Reducibility among Combinatorial Problems
1972 • 10,743 citations
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
The complexity of theorem-proving procedures
1971 • 6,155 citations
Paths, Trees, and Flowers
2009 • 1,627 citations
Some Theorems on Abstract Graphs
1952 • 1,602 citations
Probabilistic Methods in Combinatorics
1974 • 616 citations
Hamiltonian circuits in random graphs
1976 • 488 citations
On colouring random graphs
1975 • 367 citations
Time bounded random access machines
1973 • 320 citations
An O (N2.5) algorithm for maximum matching in general graphs
1975 • 297 citations
On the existence of a factor of degree one of a connected random graph
1966 • 197 citations
Optimal Algorithms for Self-Reducible Problems.
1976 • 103 citations