Cargando…
Complexity of Secure Sets
A secure set S in a graph is defined as a set of vertices such that for any [Formula: see text] the majority of vertices in the neighborhood of X belongs to S. It is known that deciding whether a set S is secure in a graph is [Formula: see text] -complete. However, it is still open how this result c...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5976766/ https://www.ncbi.nlm.nih.gov/pubmed/29937611 http://dx.doi.org/10.1007/s00453-017-0358-5 |