8 papers
Cops and Lethal Robber on Rings: A Distributed Perspective
Amanpreet Singh Saini, Ashish Saxena, Kaushik Mondal
The Cops and Robber game is extensively studied in the sequential setting where the main goal is to capture the robber. Capturing the robber means at least one cop, and the robber…
Semi-Synchronous Exploration in Dynamic Graphs
Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal +1
We study the fundamental problem of graph exploration in dynamic graphs using mobile agents. We consider -interval connected dynamic graphs, where the topology may change arbitr…
Black Hole Search: Dynamics, Distribution, and Emergence
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal +1
A black hole is a malicious node in a graph that destroys resources entering into it without leaving any trace. The problem of Black Hole Search (BHS) using mobile agents requires…
Exploration on Highly Dynamic Graphs
Ashish Saxena, Kaushik Mondal
We study the exploration problem by mobile agents in two prominent models of dynamic graphs: -Interval Connectivity and Connectivity Time. The -Interval Connectivity model wa…
When Agents are Powerful: Black Hole Search with Verification in Time-Varying Graphs
Tanvir Kaur, Ashish Saxena
A black hole is a harmful node in a graph that destroys any agent entering it, making its identification a critical task. In the \emph{Black Hole Search with Verification (BHSV)} p…
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
Ashish Saxena, Kaushik Mondal
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the …
Balanced Dispersion on Time-Varying Dynamic Graphs
Ashish Saxena, Tanvir Kaur, Kaushik Mondal
We aim to connect two problems, namely, dispersion and load balancing. Both problems have already been studied over static as well as dynamic graphs. Though dispersion and load bal…
Black Hole Search in Dynamic Graphs
Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal +1
A black hole is considered to be a dangerous node present in a graph that disposes of any resources that enter that node. Therefore, it is essential to find such a node in the grap…