Fast probabilistic algorithms for hamiltonian circuits and matchings

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

On random graphs. I.

P. Erdős, A. Rényi · Publicationes Mathematicae Debrecen · 2022 · 5.2K citations

Natural Sciences, Computer Science, Mathematics +12

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Some Theorems on Abstract Graphs

G. A. Dirac · Proceedings of the London Mathematical Society · 1952 · 1.6K citations

Natural Sciences, Computer Science, Mathematics +9

Proceedings of the 30th IEEE symposium on Foundations of computer science

Zvi Galil, E. K. Blum · Foundations of Computer Science · 1994 · 651 citations

Computing, Computer Engineering, Computer Science +14