A note on "A note on 'Some simplified NP-complete graph problems'".
Michael R. GareyDavid S. JohnsonPublished in: SIGACT News (1978)
Keyphrases
- np complete
- polynomial time complexity
- randomly generated
- np hard
- graph theoretic
- optimization problems
- satisfiability problem
- data sets
- evolutionary algorithm
- decision problems
- graph theory
- onset detection
- bounded treewidth
- pspace complete
- graph model
- structured data
- random walk
- lower bound
- computational complexity
- genetic algorithm