Jun 24, 2022 · Highlights. •. We study the problem of pebble-guided treasure hunt by a mobile agent in anonymous graphs.

Mar 10, 2021 · We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are ...

Jun 20, 2021 · We show an algorithm that uses pebbles to find the treasure in a graph G in time, where is the maximum degree of a node in G and D is the distance from the ...

Jun 24, 2022 · We study the problem of pebble-guided treasure hunt by a mobile agent in anonymous graphs. · The mobile agent, starting from a node, must find a ...

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node $v$ of degree $deg(v)$ ...

Jun 24, 2022 · We study the problem of pebble-guided treasure hunt by a mobile agent in anonymous graphs. · The mobile agent, starting from a node, must find a ...

An algorithm that uses pebbles to find the treasure in a graph G in time O(D \log \Delta + \log^3 \Delta)$, where $\Delta$ is the maximum degree of a node ...

We show an algorithm that uses O(Dlog⁡Δ) pebbles to find the treasure in a graph G in time O(Dlog⁡Δ), where Δ is the maximum degree of a node in G and D is the ...

Mar 10, 2021 · Abstract. We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node ...

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are ...