24 citations · 40 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
Optimal Dispersion of Silent Robots in a Ring
Bibhuti Das, Barun Gorain, Kaushik Mondal +2
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…
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…