Theoretical Computer Science
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
The complexity of searching a graph
Journal of the ACM (JACM)
On minimizing width in linear layouts
Discrete Applied Mathematics
Monotonicity in graph searching
Journal of Algorithms
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Sweeping graphs with large clique number
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Theoretical Computer Science
Intruder capture in Sierpinski graphs
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The cost of monotonicity in distributed graph searching
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.00 |
This paper addresses the graph searching problem in a distributed setting. We describe a distributed protocol that enables searchers with logarithmic size memory to clear any network, in a fully decentralized manner. The search strategy for the network in which the searchers are launched is computed online by the searchers themselves without knowing the topology of the network in advance. It performs in an asynchronous environment, i.e., it implements the necessary synchronization mechanism in a decentralized manner. In every network, our protocol performs a connected strategy using at most k + 1 searchers, where k is the minimum number of searchers required to clear the network in a monotone connected way, computed in the centralized and synchronous setting