2 citations · 2 across the 3 of their papers we have counts for
3 papers
Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
Prabhat Kumar Chand, Anisur Rahaman Molla
Mobile agents have emerged as a powerful framework for solving fundamental graph problems in distributed settings in recent times. These agents, modelled as autonomous physical or…
Computing Tree Structures in Anonymous Graphs via Mobile Agents
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, w…
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…