Some simplified NP-complete graph problems
Michael R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976
Cited by 2,059 works. doi:10.1016/0304-3975(76)90059-1
Authors
References
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- Complexity of Computer Computations
- Approximation algorithms for combinatorial problems
- On colouring the nodes of a network
- Fast algorithms for bin packing
- Bounds on multiprocessing anomalies and related packing algorithms
- Worst-case analysis of memory allocation algorithms
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Planar 3-colorability is polynomial complete