1 citations · 1 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Collaborative Dispersion by Silent Robots
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal +1
In the dispersion problem, a set of co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an anonymous graph $G=(…
cs.DS2021
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
Barun Gorain, Kaushik Mondal, Himadri Nayak +1
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 of degree are labeled arbitrarily as…