Some Simplified NP-Complete Graph Problems.
M. R. GareyDavid S. JohnsonLarry J. StockmeyerPublished in: Theor. Comput. Sci. (1976)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- np complete problems
- decision problems
- np hard
- computational complexity
- directed graph
- satisfiability problem
- optimization problems
- pspace complete
- scheduling problem
- constraint satisfaction problems
- neural network
- phase transition
- search algorithm
- genetic algorithm