Search citation statements
Paper Sections
Select...
1
Citation Types
0
1
0
Year Published
1997
2023
Publication Types
Select...
3
2
1
Relationship
0
6
Authors
Journals
Cited by 15 publications
(1 citation statement)
References 3 publications
0
1
0
“…Remark. The authors [2] constructed the similar graph G ′ as in Theorem 2 to prove NP-completeness of neighbor connectivity by reducing from dominating set problem. While we show NP-completeness of the substructure connectivity by reducing from vertex cover problem.…”
Section: Np-complete Of Substructure Connectivitymentioning
confidence: 99%
“…Remark. The authors [2] constructed the similar graph G ′ as in Theorem 2 to prove NP-completeness of neighbor connectivity by reducing from dominating set problem. While we show NP-completeness of the substructure connectivity by reducing from vertex cover problem.…”
Section: Np-complete Of Substructure Connectivitymentioning
confidence: 99%
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
