4 papers
Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
Gaurav Gaur, Barun Gorain, Rishi Ranjan Singh +1
We investigate the problem of finding a static treasure in anonymous graphs using oblivious agents and introduce a novel approach that leverages quantum information. In anonymous g…
Forest Covers and Bounded Forest Covers
Daya Ram Gaur, Barun Gorain, Shaswati Patra +1
We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic approximation algorithm for the forest cover problem is given using…
Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
Tanvir Kaur, Barun Gorain, Kaushik Mondal
Distance-2-Dispersion (D-2-D) problem aims to disperse mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph with nodes such…
Collision-free Exploration by Mobile Agents Using Pebbles
Sajal K. Das, Amit Kumar Dhar, Barun Gorain +1
In this paper, we study collision-free graph exploration in an anonymous pot labeled network. Two identical mobile agents, starting from different nodes in have to explore the…