Kass Bileski

Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents

We consider a team of synchronous mobile agents operating in a port-labeled network. There is one node in the network, called a black hole, that permanently destroys any agent that visits the node. The team of agents must safely locate the black hole, i.e., at least one agent must survive, terminate its algorithm at a...