Complexity of Searching for a Black Hole
Fundamenta Informaticae
Searching for a Black Hole in Synchronous Tree Networks¶
Combinatorics, Probability and Computing
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Locating and Repairing Faults in a Network with Mobile Agents
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Map construction and exploration by mobile agents scattered in a dangerous network
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Black Hole Search with Tokens in Interconnected Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Locating a Black Hole without the Knowledge of Incoming Link
Algorithmic Aspects of Wireless Sensor Networks
Synchronization Helps Robots to Detect Black Holes in Directed Graphs
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Searching for Black Holes in Subways
Theory of Computing Systems - Special Issue: Fun with Algorithms
On the power of waiting when exploring public transportation systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Locating a black hole in an un-oriented ring using tokens: the case of scattered agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Finding a good cup of coffee in Paris is difficult even among its world-renowned cafés, at least according to author David Downie (2011). We propose a solution that would allow tourists to create a map of the Paris Métro system from scratch that shows the locations of the cafés with the good coffee, while addressing the problem of the tourists losing interest in the process once they have found good coffee. We map the problem to the black hole search problem in the subway model introduced by Flocchini et al. at Fun with Algorithms 2010. We provide a solution that allows the tourists to start anywhere and at any time, communicate using whiteboards on the subway trains, rely on much less information than is normally available to subway passengers, and work independently but collectively to map the subway network. Our solution is the first to deal with scattered agents searching for black holes in a dynamic network and is optimal both in terms of the team size and the number of carrier moves required to complete the map.