More Results on the Complexity of Identifying Problems in Graphs - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2016

More Results on the Complexity of Identifying Problems in Graphs

(1, 2) , (1, 2)
1
2

Abstract

We investigate the complexity of several problems linked with identification in graphs, such as, 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 given subset of vertices. We locate these problems in the complexity classes of the polynomial hierarchy.
Not file

Dates and versions

hal-02287134 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02287134 , version 1

Cite

Olivier Hudry, Antoine Lobstein. More Results on the Complexity of Identifying Problems in Graphs. Theoretical Computer Science, 2016, 626, pp.1-12. ⟨hal-02287134⟩
27 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More