Concepedia
Theoretical Computer Science · 1976 · 2.1K citations · 17 references
EngineeringGraph TheoryNp-complete Graph ProblemsStructural Graph TheoryComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationGraph Algorithm
17
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.1K citations · Full text
Engineering, Verification, Automated Proof +17
Approximation algorithms for combinatorial problems
David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations
Engineering, Combinatorial Problem, Computational Complexity +6
On colouring the nodes of a network
Rachelle L. Brooks · Mathematical Proceedings of the Cambridge Philosophical Society · 1941 · 1K citations
Get Access Link, Humanities, Network Science +9
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 532 citations
Minimum Coloring, Engineering, Planar Graph +17
Fast algorithms for bin packing
David S. Johnson · Journal of Computer and System Sciences · 1974 · 532 citations
Engineering, Geometric Algorithm, Combinatorial Problem +8