Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Minimal trees of given search number
Discrete Mathematics
The complexity of searching a graph
Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotonicity in graph searching
Journal of Algorithms
The vertex separation number of a graph equals its path-width
Information Processing Letters
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
The vertex separation and search number of a graph
Information and Computation
Mixed searching and proper-path-width
Theoretical Computer Science
A pursuit-evasion problem on a grid
Information Processing Letters
Complexity of searching an immobile hider in a graph
Discrete Applied Mathematics
Bushiness and a tight worst-case upper bound on the search number of a simple polygon
Information Processing Letters
Journal of the ACM (JACM)
NetSTAT: a network-based intrusion detection system
Journal of Computer Security
Algorithms and obstructions for linear-width and related search parameters
Discrete Applied Mathematics
Intrusion detection using autonomous agents
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on recent advances in intrusion detection systems
Graph Searching and Interval Completion
SIAM Journal on Discrete Mathematics
Minimizing Width in Linear Layouts
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Formalization of Graph Search Algorithms and Its Applications
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Network Awareness for Mobile Agents on Ad Hoc Networks
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
Broadcast in the rendezvous model
Information and Computation
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
Distributed chasing of network intruders
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Monotony properties of connected visible graph searching
Information and Computation
Theoretical Computer Science
Edge searching weighted graphs
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Markovian search games in heterogeneous spaces
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Self-stabilizing Algorithm for Graph Searching in Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Broadcast in the rendezvous model
Information and Computation
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
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The cost of monotonicity in distributed graph searching
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
GSST: anytime guaranteed search
Autonomous Robots
Improving the Efficiency of Clearing with Multi-agent Teams
International Journal of Robotics Research
Connected searching of weighted trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Decontamination of chordal rings and tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network decontamination with temporal immunity by cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Secure upgrade of hardware security modules in bank networks
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Connected searching of weighted trees
Theoretical Computer Science
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Capturing an intruder in product networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Monotony properties of connected visible graph searching
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Service discovery on dynamic peer-to-peer networks using mobile agents
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Connected treewidth and connected graph searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.01 |
Consider a team of mobile software agents deployed to capture a (possibly hostile) intruder in a network. All agents, including the intruder move along the network links; the intruder could be arbitrarily fast, and aware of the positions of all the agents. The problem is to design the agents' strategy for capturing the intruder. The main efficiency parameter is the size of the team. This is an instance of the well known graph-searching problem whose many variants have been extensively studied in the literature. In all existing solutions, and in all the variants of the problem, it is assumed that agents can be removed from their current location and placed in another network site arbitrarily and at any time. As a consequence, the existing optimal strategies cannot be employed in situations for which agents cannot access the network at any point, or cannot "jump" across the network, or cannot reach an arbitrary point of the network via an internal travel through insecure zones. This motivates the contiguous search problem in which agents cannot be removed from the network, and clear links must form a connected sub-network at any time, providing safety of movements. This new problem is NP-complete in general. We study it for tree networks, and we consider its more general version, the weighted case, which arises naturally when considering networks whose nodes and links are of different nature and thus require a different number of agents to be explored. We give a linear-time algorithm that computes, for any tree $T$, the minimum number of agents to capture the intruder, and the corresponding search strategy. Beside its optimality in time, our algorithm is naturally distributed: if $T$ is a processor-network, then the minimal search strategy for $T$ can be computed by $T$ in a decentralized manner, using a linear number of messages.