Search Results - "Lobstein, Antoine"

The Compared Costs of Domination Location-Domination and Identification by Hudry, Olivier, Lobstein, Antoine

“…Let = ( ) be a finite graph and ≥ 1 be an integer. For ∈ , let ) = { ∈ : ) ≤ } be the ball of radius centered at . A set ⊆ is an -dominating code if for all ∈…”
Get full text

Some rainbow problems in graphs have complexity equivalent to satisfiability problems by Hudry, Olivier, Lobstein, Antoine

“…In a vertex‐colored graph, a set of vertices S is said to be a rainbow set if every color in the graph appears exactly once in S. We investigate the…”
Get full text

More results on the complexity of identifying problems in graphs by Hudry, Olivier, Lobstein, Antoine

“…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…”
Get full text

Some results about a conjecture on identifying codes in complete suns by Hudry, Olivier, Lobstein, Antoine

“…Consider a graph G=(V,E) and, for every vertex v∈V, denote by B(v) the set {v}∪{u:uv∈E}. A subset C⊆V is an identifying code if the sets B(v)∩C, v∈V, are…”
Get full text

On the ensemble of optimal dominating and locating-dominating codes in a graph by Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine

“…Let G be a simple, undirected graph with vertex set V. For every v∈V, we denote by N(v) the set of neighbours of v, and let N[v]=N(v)∪{v}. A set C⊆V is said to…”
Get full text

Intersection matrices for partitions by binary perfect codes by Avgustinovich, S.V., Lobstein, A.C., Solov'eva, F.I.

“…We investigate the following problem: given two partitions of the Hamming space, their intersection matrix provides the cardinalities of the pairwise…”
Get full text

On the number of optimal identifying codes in a twin-free graph by Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine

“…Let G be a simple, undirected graph with vertex set  V. For v∈V and r≥1, we denote by BG,r(v) the ball of radius  r and centre  v. A set C⊆V is said to be an…”
Get full text

Watching systems in graphs: An extension of identifying codes by Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching…”
Get full text

On the ensemble of optimal identifying codes in a twin-free graph by Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine

“…Let G = ( V , E ) be a graph. For v ∈ V and r ≥ 1, we denote by B G , r ( v ) the ball of radius r and centre v . A set C ⊆ V is said to be an r - identifying…”
Get full text

Maximum size of a minimum watching system and the graphs achieving the bound by Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Let G=(V(G),E(G)) be an undirected graph. A watcher w of  G is a couple w = (ℓ(w), A(w)), where ℓ(w) belongs to  V(G) and A(w)  is a set of vertices of  G at…”
Get full text

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard by Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Let G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (respectively, v∈V⧹C), are all nonempty and different, where Br(v)…”
Get full text

On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path by Hudry, Olivier, Lobstein, Antoine

“…The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying…”
Get full text

On Iiro Honkala's contributions to identifying codes by Hudry, Olivier, Junnila, Ville, Lobstein, Antoine

“…Fundamenta Informaticae, Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday (November 10, 2024) fi:13052 A set $C$ of vertices in a graph $G=(V,E)$ is an…”
Get full text

Extremal cardinalities for identifying and locating-dominating codes in graphs by Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Consider a connected undirected graph G = ( V , E ) , a subset of vertices C ⊆ V , and an integer r ⩾ 1 ; for any vertex v ∈ V , let B r ( v ) denote the ball…”
Get full text

Minimum sizes of identifying codes in graphs differing by one edge by Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine

“…Let G be a simple, undirected graph with vertex set V . For v ∈ V and r ≥ 1, we denote by B G , r ( v ) the ball of radius r and centre v . A set 𝒞 ⊆ V is…”
Get full text

Identifying and locating-dominating codes on chains and cycles by Bertrand, Nathalie, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Consider a connected undirected graph G=( V, E), a subset of vertices C⊆ V, and an integer r≥1; for any vertex v∈ V, let B r ( v) denote the ball of radius r…”
Get full text

Minimum sizes of identifying codes in graphs differing by one vertex by Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine

“…Let G be a simple, undirected graph with vertex set  V . For v  ∈  V and r  ≥ 1, we denote by B G , r ( v ) the ball of radius  r and centre  v . A set is said…”
Get full text

Nonatomic Non-Cooperative Neighbourhood Balancing Games by Auger, David, Cohen, Johanne, Lobstein, Antoine

“…Fundamenta Informaticae, Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday (November 10, 2024) fi:11080 We introduce a game where players selfishly choose a…”
Get full text

Complexity results for identifying codes in planar graphs by Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Let G be a simple, undirected, connected graph with vertex set V(G) and 𝒞⊆V(G) be a set of vertices whose elements are called codewords. For v∈V(G) and r1,…”
Get full text

New identifying codes in the binary Hamming space by Charon, Irène, Cohen, Gérard, Hudry, Olivier, Lobstein, Antoine

“…Let F n be the binary n -cube, or binary Hamming space of dimension n , endowed with the Hamming distance. For r ≥ 1 and x ∈ F n , we denote by B r ( x ) the…”
Get full text