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žené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 626; s. 1 - 12
Hlavní autori:	Hudry, Olivier, Lobstein, Antoine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 02.05.2016 Elsevier
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!