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: | Bliem, Bernhard, Woltran, Stefan |
---|---|
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 |
Ejemplares similares
-
Ranking Specific Sets of Objects
por: Maly, Jan, et al.
Publicado: (2017) -
Foundations of information and knowledge systems: 10th international symposium, FOIKS 2018, Budapest, Hungary, May 14-18, 2018, proceedings
por: Ferrarotti, Flavio, et al.
Publicado: (2018) -
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
por: Hecher, Markus, et al.
Publicado: (2020) -
Logic programming and nonmonotonic reasoning: 15th international conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, proceedings
por: Balduccini, Marcello, et al.
Publicado: (2019) -
Advances in knowledge representation, logic programming, and abstract argumentation: essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
por: Eiter, Thomas, et al.
Publicado: (2015)