Black hole search in dynamic cactus graph

DOI10.1007/978-981-97-0566-5_21MaRDI QIDQ6575403zbMATH OpenFDO

Authors Adri Bhattacharya, Giuseppe F. Italiano, P. S. Mandal

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_21

zbMATH Keywords

black hole searchdistributed algorithmsdynamic cactus graphdynamic networksmobile agentstime-varying graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Complexity of searching for a black hole
• Distributed computation in dynamic networks
• Distributed exploration of dynamic rings
• Exploration of dynamic cactuses with sub-logarithmic overhead
• Exploration of dynamic networks: tight bounds on the number of agents
• Exploration of dynamic tori by multiple agents
• Gathering in dynamic rings
• Graph exploration by a finite automaton
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Searching for a Black Hole in Synchronous Tree Networks
• Searching for black holes in subways
• USING SCATTERED MOBILE AGENTS TO LOCATE A BLACK HOLE IN AN UN-ORIENTED RING WITH TOKENS

Cited in

(2)

• Monotone decontamination of arbitrary dynamic graphs with mobile agents
• Searching for a black hole in a dynamic cactus

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)