Add to ORKGIn this work we study the associated polyhedra and present some general results on their combinatorial structure. We demonstrate how the polyhedral approach can be applied to find minimum identifying codes for special bipartite graphs and cycles, and discuss further lines of research in order to obtain strong lower bounds stemming from linear relaxations of the identifying code polyhedron, enhanced by suitable cutting planes to be used in a B&C framework.Sociedad Argentina de Informática e Investigación Operativ
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractIn this paper we deal with identifying codes in cycles. We show that for all r≥1, any r-iden...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
The identifying code problem is a newly emerging search problem, challenging both from a theoretical...
International audienceThe identifying code problem is a newly emerging search problem, challenging b...
International audienceThe identifying code problem is a newly emerging search problem, challenging b...
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code i...
The work presented in this document deals with identifying codes in graphs. This notion, introduced ...
AbstractLet G be a graph and B(u) be the set of u with all of its neighbors in G. A set S of vertice...
Un code identifiant est un ensemble de sommets d'un graphe tel que, d'une part, chaque sommet hors d...
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Th...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
AbstractLet G be a finite undirected graph with vertex set V(G). If v∈V(G), let N[v] denote the clos...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractIn this paper we deal with identifying codes in cycles. We show that for all r≥1, any r-iden...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
The identifying code problem is a newly emerging search problem, challenging both from a theoretical...
International audienceThe identifying code problem is a newly emerging search problem, challenging b...
International audienceThe identifying code problem is a newly emerging search problem, challenging b...
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code i...
The work presented in this document deals with identifying codes in graphs. This notion, introduced ...
AbstractLet G be a graph and B(u) be the set of u with all of its neighbors in G. A set S of vertice...
Un code identifiant est un ensemble de sommets d'un graphe tel que, d'une part, chaque sommet hors d...
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Th...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
AbstractLet G be a finite undirected graph with vertex set V(G). If v∈V(G), let N[v] denote the clos...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
AbstractIn this paper we deal with identifying codes in cycles. We show that for all r≥1, any r-iden...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...