Search Results - "Auger, David"

Minimal identifying codes in trees and planar graphs with large girth by Auger, David

“…Let G be a finite undirected graph with vertex set V ( G ) . If v ∈ V ( G ) , let N [ v ] denote the closed neighbourhood of v , i.e.  v itself and all its…”
Get full text

Combinatorial identification problems and graph powers by Auger, David

“…This is a summary of the author’s PhD thesis supervised by Pr. Olivier Hudry and defended on 7th June 2010 at Télécom ParisTech. The thesis is written in…”
Get full text

Watching Systems in the King Grid by Auger, David, Honkala, Iiro

“…We consider the infinite King grid where we investigate properties of watching systems, an extension of the notion of identifying code recently introduced by…”
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

Identifying Codes in Trees and Planar Graphs by Auger, David

“…We deal with a few issues related to the problem of finding the minimum size of an identifying code in a graph. First, we provide a linear algorithm which…”
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

Sphere coverings and identifying codes by Auger, David, Cohen, Gérard, Mesnager, Sihem

“…In any connected, undirected graph G  = ( V , E ), the distance d ( x , y ) between two vertices x and y of G is the minimum number of edges in a path linking…”
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

On the sizes of graphs and their powers: The undirected case by Auger, David, Charon, Irène, Hudry, Olivier, Lobstein, Antoine

“…Let G be an undirected graph and G r be its r -th power. We study different issues dealing with the number of edges in G and  G r . In particular, we answer…”
Get full text

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs by Auger, David, Coucheney, Pierre, Duhaze, Loric

“…A rotor walk in a directed graph can be thought of as a deterministic version of a Markov Chain, where a pebble moves from vertex to vertex following a simple…”
Get full text

Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs by Auger, David, Coucheney, Pierre, Duhazé, Loric, Etse, Kossi Roland

“…Rotor walks are cellular automata that determine deterministic traversals of particles in a directed multigraph using simple local rules, yet they can generate…”
Get full text

Sphere coverings and identifying codes by AUGER, David, COHEN, Gérard, MESNAGER, Sihem

Get full text

Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule by Auger, David, Coucheney, Pierre, Strozecki, Yann

“…The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected $2^{O(\sqrt{n})}$ time. We first give a…”
Get full text

Multiple Tree for Partially Observable Monte-Carlo Tree Search by Auger, David

“…We propose an algorithm for computing approximate Nash equilibria of partially observable games using Monte-Carlo tree search based on recent bandit methods…”
Get full text

On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph by Auger, David, Charon, Iréne, Hudry, Olivier, Lobstein, A.

“…Abstract only…”
Get full text

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games by Auger, David, COUCHENEY, Pierre, Strozecki, Yann

“…The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems…”
Get full text

SLA learning from past failures, a Multi-Armed Bandit approach by Rodier, Lise, Auger, David, Cohen, Johanne, Pouyllau, Helia

“…A Service Level Agreement (SLA) is a contract between a customer and a Network Service Provider (NSP) defining services to one or more destinations at a given…”
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

GDA-J/F3 monoclonal antibody as a novel probe for the human sperm tail fibrous sheath and its anomalies by Jassim, A, Auger, D, Oliver, T, Sachs, J

“…GDA-J/F3 monoclonal antibody (MoAb) recognized an antigen in the fibrous sheath (FS) of human spermatozoa. This was based on: (i) intracellular localization of…”
Get more information