More results on the complexity of identifying problems in graphs

We investigate the complexity of several problems linked with identification in graphs; for instance, given an integer r≥1 and a graph G=(V,E), the existence of, or search for, optimal r-identifying codes in G, or optimal r-identifying codes in G containing a subset of vertices X⊂V. We locate these...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 626; s. 1 - 12
Hlavní autoři: Hudry, Olivier, Lobstein, Antoine
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 02.05.2016
Elsevier
Témata:
Combinatorics
Complexity
Complexity classes
Computational Complexity
Computer Science
Discrete Mathematics
Graph theory
Graphs
Hardness
Hierarchies
Identifying codes
Integers
Mathematics
NP-completeness
Optimization
Polynomial hierarchy
Polynomials
Searching
Twin-free graphs
Twin-free graphs
NP-completeness
Polynomial hierarchy
Graph theory
Hardness
Identifying codes
Complexity
Complexity classes
Complexity Classes
Identifying Codes
Polyno- mial Hierarchy
NP-Completeness
Twin-Free Graphs
Graph Theory
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate the complexity of several problems linked with identification in graphs; for instance, given an integer r≥1 and a graph G=(V,E), the existence of, or search for, optimal r-identifying codes in G, or optimal r-identifying codes in G containing a subset of vertices X⊂V. We locate these problems in the complexity classes of the polynomial hierarchy.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.01.021