67 citations · 118 across the 26 of their papers we have counts for
4 papers · 1 filter
Optimal Fault-Tolerant Dispersion on Oriented Grids
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla
Dispersion of mobile robots over the nodes of an anonymous graph is an important problem and turns out to be a crucial subroutine for designing efficient algorithms for many fundam…
Optimizing Robot Dispersion on Grids: with and without Fault Tolerance
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla
The introduction and study of dispersing mobile robots across the nodes of an anonymous graph have recently gained traction and have been explored within various graph classes and…
Agent-based Leader Election, MST, and Beyond
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
Leader election is one of the fundamental and well-studied problems in distributed computing. In this paper, we initiate the study of leader election using mobile agents. Suppose $…
Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla
In this paper, we study the problem of \emph{triangle counting} in an arbitrary anonymous graph with nodes and edges using the \emph{mobile-agent model}. Our triangle-c…