24 citations · 40 across the 17 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DC2020
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
The problem of dispersion of mobile robots on a graph asks that robots initially placed arbitrarily on the nodes of an -node anonymous graph, autonomously move to reach a fi…
cs.DS2020★ 10 cited
NP-Completeness Results for Graph Burning on Geometric Graphs
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of…