Geodesic
Search for the end of a path in the d-dimensional grid and in other graphs
Ars Mathematica Contemporanea, Tome 12 (2017) no. 2, pp. 301-314.

Voir la notice de l'article provenant de la source Ars Mathematica Contemporanea website

We consider the worst-case query complexity of some variants of certain PPAD-complete search problems. Suppose we are given a graph G and a vertex s ∈ V(G). We denote the directed graph obtained from G by directing all edges in both directions by Gʹ. D is a directed subgraph of Gʹ which is unknown to us, except that it consists of vertex-disjoint directed paths and cycles and one of the paths originates in s. Our goal is to find an endvertex of a path by using as few queries as possible. A query specifies a vertex v ∈ V(G), and the answer is the set of the edges of D incident to v, together with their directions.We also show lower bounds for the special case when D consists of a single path. Our proofs use the theory of graph separators. Finally, we consider the case when the graph G is a grid graph. In this case, using the connection with separators, we give asymptotically tight bounds as a function of the size of the grid, if the dimension of the grid is considered as fixed. In order to do this, we prove a separator theorem about grid graphs, which is interesting on its own right.
DOI : 10.26493/1855-3974.788.89a
Keywords: Separator, graph, search, grid 
@article{10_26493_1855_3974_788_89a,
     author = {D\'aniel Gerbner and Bal\'azs Keszegh and D\"om\"ot\"or P\'alv\"olgyi and G\"unter Rote and G\'abor Wiener},
     title = {Search for the end of a path in the d-dimensional grid and in other graphs},
     journal = {Ars Mathematica Contemporanea},
     pages = {301--314},
     publisher = {mathdoc},
     volume = {12},
     number = {2},
     year = {2017},
     doi = {10.26493/1855-3974.788.89a},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.788.89a/}
}
TY  - JOUR
AU  - Dániel Gerbner
AU  - Balázs Keszegh
AU  - Dömötör Pálvölgyi
AU  - Günter Rote
AU  - Gábor Wiener
TI  - Search for the end of a path in the d-dimensional grid and in other graphs
JO  - Ars Mathematica Contemporanea
PY  - 2017
SP  - 301
EP  - 314
VL  - 12
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.788.89a/
DO  - 10.26493/1855-3974.788.89a
LA  - en
ID  - 10_26493_1855_3974_788_89a
ER  - 
%0 Journal Article
%A Dániel Gerbner
%A Balázs Keszegh
%A Dömötör Pálvölgyi
%A Günter Rote
%A Gábor Wiener
%T Search for the end of a path in the d-dimensional grid and in other graphs
%J Ars Mathematica Contemporanea
%D 2017
%P 301-314
%V 12
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.788.89a/
%R 10.26493/1855-3974.788.89a
%G en
%F 10_26493_1855_3974_788_89a
Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Günter Rote; Gábor Wiener. Search for the end of a path in the d-dimensional grid and in other graphs. Ars Mathematica Contemporanea, Tome 12 (2017) no. 2, pp. 301-314. doi : 10.26493/1855-3974.788.89a. http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.788.89a/

Cité par Sources :