Black hole search in dynamic cactus graph
From MaRDI portal
Publication:6575403
DOI10.1007/978-981-97-0566-5_21MaRDI QIDQ6575403FDOQ6575403
Authors: Adri Bhattacharya, Giuseppe F. Italiano, P. S. Mandal 
Publication date: 19 July 2024
dynamic networksdistributed algorithmsmobile agentsblack hole searchtime-varying graphsdynamic cactus graph
Cites Work
- Graph exploration by a finite automaton
- Distributed computation in dynamic networks
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS
- Searching for a Black Hole in Synchronous Tree Networks
- Complexity of searching for a black hole
- Searching for black holes in subways
- Gathering in dynamic rings
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Distributed exploration of dynamic rings
- Exploration of dynamic tori by multiple agents
- Exploration of dynamic networks: tight bounds on the number of agents
This page was built for publication: Black hole search in dynamic cactus graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575403)
