Theoretical Computer Science · 2007 · 30 citations · 20 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationCombinatorial OptimizationComputational ComplexityGraph AlgorithmsGraph TheoryStructural ComplexityComputational Complexity Of Graph Algorithms
20
Some simplified NP-complete graph problems
M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations
Characterizations of strongly chordal graphs
Martin Farber · Discrete Mathematics · 1983 · 350 citations
Ryan Hayward · Journal of Combinatorial Theory Series B · 1985 · 230 citations