Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Monotonicity in graph searching
Journal of Algorithms
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Edge and node searching problems on trees
Theoretical Computer Science - computing and combinatorics
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Efficient Self-stabilizing Algorithms for Tree Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Distributed chasing of network intruders
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
A Distributed Algorithm for Computing and Updating the Process Number of a Forest
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Tree Decontamination with Temporary Immunity
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Theoretical Computer Science
The cost of monotonicity in distributed graph searching
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Efficient self-stabilizing graph searching in tree networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Hi-index | 0.00 |
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving along the edges of the graph. In this paper we consider the graph searching problem in a network environment, namely a tree network. Searchers are software programs and the fugitive is a virus that spreads rapidly. Every node of the network which the virus may have reached, becomes contaminated. The purpose of the game is to clean the network. In real world distributed systems faults can occur and thus it is desirable for an algorithm to be able to facilitate the cleaning of a network in an optimal way, and also to reconfigure on the fly. In this paper we give the first self-stabilizing algorithm for solving the graph searching problem in trees. Our algorithm stabilizes after O (n 3) time steps under the distributed adversarial daemon. Our algorithm solves the node searching variant of the graph searching problem, but can with small modifications also solve edge and mixed searching.