Complexity of searching for a black hole

MaRDI QIDQ5480656zbMATH OpenFDO

Authors Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc

Publication date 3 August 2006

zbMATH Keywords

approximation algorithmblack holegraphmobile agentNP-hard problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Principles of Distributed Systems
• Approximation bounds for Black Hole Search problems
• Structural Information and Communication Complexity
• Searching for a Black Hole in Synchronous Tree Networks
• Hardness and approximation results for black hole search in arbitrary networks

Cited in

(12)

• Ping pong in dangerous graphs: optimal black hole search with pebbles
• Collusion attack from hubs in the blockchain offline channel network
• Locating and Repairing Faults in a Network with Mobile Agents
• Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
• Approximation bounds for Black Hole Search problems
• Tight bounds for black hole search with scattered agents in synchronous rings
• Identifying hostile nodes in networks using mobile agents
• Searching for a Black Hole in Synchronous Tree Networks
• Structural Information and Communication Complexity
• Black hole search in dynamic cactus graph
• Searching for black holes in subways
• Exploring an unknown dangerous graph with a constant number of tokens

This page was built for publication: Complexity of searching for a black hole

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480656)