Showing 2025 · cs.DCShow all
2 papers · 2 filters
cs.DC2025
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…
cs.DC2025
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
Ashish Saxena, Kaushik Mondal
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the …