The Node-Deletion Problem for Hereditary Properties is NP-Complete.
John M. LewisMihalis YannakakisPublished in: J. Comput. Syst. Sci. (1980)
Keyphrases
- np complete
- computational complexity
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- polynomial time complexity
- np complete problems
- np hard
- conjunctive queries
- tree structure
- website
- structural properties
- desirable properties
- data complexity
- directed graph
- relational databases
- decision trees