Node-Deletion NP-Complete Problems
- 1 November 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (4), 619-625
- https://doi.org/10.1137/0208049
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- R -Domination in GraphsJournal of the ACM, 1976
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969