6 papers · 1 filter
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…
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…
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…
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…
Distance-2-Dispersion: Dispersion with Further Constraints
Tanvir Kaur, Kaushik Mondal
The aim of the dispersion problem is to place a set of mobile robots in the nodes of an unknown graph consisting of nodes such that in the final configuration each…