3 papers
cs.DC2023
Black Hole Search in Dynamic Cactus Graph
Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal
We study the problem of black hole search by a set of mobile agents, where the underlying graph is a dynamic cactus. A black hole is a dangerous vertex in the graph that eliminates…
cs.DC2023
Pebble guided Treasure Hunt in Plane
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal
We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modele…
cs.DC2022
Treasure Hunt in Graph using Pebbles
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal
In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph are anonymous and the edges incident to a vertex whose deg…