An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code.
Jul 22, 2014
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbors within the ...
It is shown that the problem of finding a smallest identifying code in a given graph from some class is log-APX-hard for any hereditary class of infinite ...
We show that hereditary classes with infinite VC-dimension have infinitely many graphs with an identifying code of size logarithmic in the number of vertices.
Feb 27, 2015 · An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its ...
People also ask
What is a hereditary class of graphs?
[PDF] Identifying codes and VC-dimension - Laboratoire G-SCOP
pagesperso.g-scop.grenoble-inp.fr › ...
If C has infinite VC-dimension, C contains: • all bipartite graphs, or. • all split graphs, or. • all cobipartite graphs. Proposition.
Missing: Hereditary | Show results with:Hereditary
This work exhibits important graph classes for which Minimum Dominating Set is efficiently solvable, but Minimum Identifying Code is hard (whereas in all ...
The VC-dimension of a graph was also linked to the complexity of approximating a minimum-cardinality identifying code on hereditary graph classes [4]. The most ...
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension · Nicolas Bousquet,; Aurélie Lagoutte,; Zhentao Li,; Aline Parreau,; Stéphan Thomassé.
Identifying codes and the set cover problem - ResearchGate
www.researchgate.net › publication › 22...
PDF | We consider the problem of finding a minimum identifying code in a graph, i.e., a designated set of vertices whose neighborhoods uniquely overlap.