The node-deletion problem for hereditary properties is NP-complete
- 1 April 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 20 (2), 219-230
- https://doi.org/10.1016/0022-0000(80)90060-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the complexity of the Maximum Subgraph ProblemPublished by Association for Computing Machinery (ACM) ,1978
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972