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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 626; pp. 1 - 12
Main Authors:	Hudry, Olivier, Lobstein, Antoine
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02.05.2016 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!