Discrete Applied Mathematics · 2006 · 87 citations · 29 references
ComputingComputer ScienceAlgorithmsEdge ComputingApproximation AlgorithmsCombinatorial OptimizationComputational ComplexityGraph AlgorithmsGraph TheoryCompleteness ReductionsCompleteness ResultsGraph RelaxationNp-complete ProblemsNp-completeness
29
Some simplified NP-complete graph problems
M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations
Ben Dushnik, E. W. Miller · American Journal of Mathematics · 1941 · 943 citations