Theoretical Computer Science
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Layout problems and their complexity
Layout problems and their complexity
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the Monotonicity of Games Generated by Symmetric Submodular Functions
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On the domination search number
Discrete Applied Mathematics
On the monotonicity of games generated by symmetric submodular functions
Discrete Applied Mathematics - Submodularity
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Searching expenditure and interval graphs
Discrete Applied Mathematics
Randomized pursuit-evasion with limited visibility
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the vertex separation of unicyclic graphs
Information and Computation
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
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Capturing an intruder in product networks
Journal of Parallel and Distributed Computing
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
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
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
Digraph Strong Searching: Monotonicity and Complexity
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Searching Trees with Sources and Targets
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On the Monotonicity of Weak Searching
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Monotonicity in digraph search problems
Theoretical Computer Science
Monotony properties of connected visible graph searching
Information and Computation
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Theoretical Computer Science
Maximum vertex occupation time and inert fugitive: Recontamination does help
Information Processing Letters
Edge searching weighted graphs
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A PSO solution for pursuit-evasion problem of randomly mobile agents
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Tracking mobile users in cellular networks using timing information
Nordic Journal of Computing
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
Directed searching digraphs: monotonicity and complexity
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
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
Mixed search number and linear-width of interval and split graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
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
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Agent-based coordination of human-multirobot teams in complex environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
ESP: pursuit evasion on series-parallel graphs
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
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
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
Fast edge searching and fast searching on graphs
Theoretical Computer Science
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
LIFO-search on digraphs: a searching game for cycle-rank
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Fast searching games on graphs
Journal of Combinatorial Optimization
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
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Sweeping graphs with large clique number
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Edge search number of cographs
Discrete Applied Mathematics
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Pathwidth and searching in parameterized threshold graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Cleaning an arbitrary regular network with mobile agents
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
A graph search algorithm for indoor pursuit/evasion
Mathematical and Computer Modelling: An International Journal
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
Lower bounds on edge searching
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Discrete Applied Mathematics
| Hi-index | 0.01 |
This paper is concerned with a game on graphs called graph searching. The object of this game is to clear all edges of a contaminated graph. Clearing is achieved by moving searchers, a kind of token, along the edges of the graph according to clearing rules. Certain search strategies cause edges that have been cleared to become contaminated again. Megiddo et al. [9] conjectured that every graph can be searched using a minimum number of searchers without this recontamination occurring, that is, without clearing any edge twice. In this paper, this conjecture is proved. This places the graph-searching problem in NP, completing the proof by Megiddo et al. that the graph-searching problem is NP-complete. Furthermore, by eliminating the need to consider recontamination, this result simplifies the analysis of searcher requirements with respect to other properties of graphs.