A note on "Some simplified NP-complete graph problems".
M. S. KrishnamoorthyPublished in: SIGACT News (1977)
Keyphrases
- np complete
- polynomial time complexity
- satisfiability problem
- randomly generated
- np hard
- constraint satisfaction problems
- bounded treewidth
- connected components
- optimization problems
- random walk
- decision problems
- image segmentation
- weighted graph
- graph partitioning
- graph representation
- graph theoretic
- pspace complete
- conp complete
- computational complexity