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…