Computing · 1976 · 409 citations · 5 references
ComputingComputer ScienceAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsCombinatorial OptimizationCommunication ComplexityComputational ComplexityNetwork Information TheoryShortest Path AlgorithmsCompleteness ResultsNp-complete ProblemsNp-completeness
5
Some simplified NP-complete problems
M. R. Garey, D. S. Johnson, Larry Stockmeyer · 1974 · 603 citations · Full text
Minimizing the bandwidth of sparse symmetric matrices
K. Y. Cheng · Computing · 1973 · 44 citations
P-complete problems and approximate solutions
Sartaj Sahni, Teofilo Gonzales · 1974 · 41 citations
Note on minimizing the bandwidth of sparse, symmetric matrices
K. Y. Cheng · Computing · 1973 · 25 citations