An annotated bibliography on guaranteed graph searching

Authors:
Fedor V. Fomin;Dimitrios M. Thilikos
Affiliations:
Department of Informatics, University of Bergen, PO Box 7800, 5020 Bergen, Norway;Department of Mathematics National & Kapodistrian University of Athens, Panepistimioupolis, GR-15784, Athens, Greece
Venue:
Theoretical Computer Science
Year:
2008

Citing 74
Cited 56

On a pursuit game played on graphs for which a minor is excluded

Journal of Combinatorial Theory Series B
Some results about pursuit games on metric spaces obtained through graph theory techniques

European Journal of Combinatorics
Searching and pebbling

Theoretical Computer Science
Minimal trees of given search number

Discrete Mathematics
On a pursuit game on Cayley graphs

Combinatorica
Cops and robbers in graphs with large girth and Cayley graphs

Discrete Applied Mathematics
On a game of policemen and robber

Discrete Applied Mathematics
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
On a pursuit game of Cayley diagraphs

European Journal of Combinatorics
The complexity of searching a graph

Journal of the ACM (JACM)
On bridged graphs and cop-win graphs

Journal of Combinatorial Theory Series A
Optimal algorithms for a pursuit-evasion problem in grids

SIAM Journal on Discrete Mathematics
On minimizing width in linear layouts

Discrete Applied Mathematics
The searchlight scheduling problem

SIAM Journal on Computing
Monotonicity in graph searching

Journal of Algorithms
Quickly excluding a forest

Journal of Combinatorial Theory Series B
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
Some pursuit-evasion problems on grids

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Search and sweep numbers of finite directed acyclic graphs

Discrete Applied Mathematics
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
The summation and bottleneck minimization for single-step searching on weighted graphs

Information Sciences: an International Journal
Bounded tree-width and LOGCFL

Journal of Algorithms
Regular Article: On the Cop Number of a Graph

Advances in Applied Mathematics
The vertex separation and search number of a graph

Information and Computation
Single step searching in weighted block graphs

Information Sciences—Informatics and Computer Science: An International Journal
Mixed searching and proper-path-width

Theoretical Computer Science
The complexity of pursuit on a graph

Theoretical Computer Science
A pursuit-evasion problem on a grid

Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Bridged graphs are cop-win graphs: an algorithmic proof

Journal of Combinatorial Theory Series B
Helicopter search problems, bandwidth and pathwidth

Discrete Applied Mathematics
A game of cops and robbers played on products of graphs

Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
Gibbs measures and dismantlable graphs

Journal of Combinatorial Theory Series B
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
On constructible graphs, infinite bridged graphs and weakly cop-win graphs

Discrete Mathematics
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics
Directed tree-width

Journal of Combinatorial Theory Series B
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
On the domination search number

Discrete Applied Mathematics
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Journal of Computer and System Sciences - Special issu on PODS 2001
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
On the monotonicity of games generated by symmetric submodular functions

Discrete Applied Mathematics - Submodularity
Computing the vertex separation of unicyclic graphs

Information and Computation
Searching a polygonal region by a group of stationary k-searchers

Information Processing Letters
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
Constraint solving via fractional edge covers

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
DAG-width: connectivity measure for directed graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sweeping simple polygons with the minimum number of chain guards

Information Processing Letters
Generalized hypertree decompositions: np-hardness and tractable variants

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Digraph measures: Kelly decompositions, games, and orderings

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Marshals, monotone marshals, and hypertree-width

Journal of Graph Theory
Decontamination of hypercubes by mobile agents

Networks - Games, Interdiction, and Human Interaction Problems on Networks
Digraph Strong Searching: Monotonicity and Complexity

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Connected graph searching in chordal graphs

Discrete Applied Mathematics
Graph searching with advice

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
Graph searching in a crime wave

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
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
Arc searching digraphs without jumping

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Monotony properties of connected visible graph searching

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Distributed chasing of network intruders

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Nondeterministic graph searching: from pathwidth to treewidth

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hypertree decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Domination search on graphs with low dominating-target-number

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Connected treewidth and connected graph searching

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Lower bounds on edge searching

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

On the Fast Searching Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Vision-Based Pursuit-Evasion in a Grid

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Distributed Algorithm for Computing and Updating the Process Number of a Forest

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Monotony properties of connected visible graph searching

Information and Computation
Computing and Updating the Process Number in Trees

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Searching for a Visible, Lazy Fugitive

Graph-Theoretic Concepts in Computer Science
Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Reconfiguration of the routing in WDM networks with two classes of services

ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
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
Pursuing a fast robber on a graph

Theoretical Computer Science
Quiescence of self-stabilizing gossiping among mobile agents in graphs

Theoretical Computer Science
Pursuit-evasion on trees by robot teams

IEEE Transactions on Robotics
GSST: anytime guaranteed search

Autonomous Robots
Improving the Efficiency of Clearing with Multi-agent Teams

International Journal of Robotics Research
CSP duality and trees of bounded pathwidth

Theoretical Computer Science
ESP: pursuit evasion on series-parallel graphs

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Cops and Robbers from a distance

Theoretical Computer Science
Parameterized pursuit-evasion games

Theoretical Computer Science
Tradeoffs in process strategy games with application in the WDM reconfiguration problem

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Connected searching of weighted trees

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Efficient self-stabilizing graph searching in tree networks

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Vision-Based Pursuit-Evasion in a Grid

SIAM Journal on Discrete Mathematics
Characterization of graphs and digraphs with small process numbers

Discrete Applied Mathematics
Digraph decompositions and monotonicity in digraph searching

Theoretical Computer Science
Tradeoffs in process strategy games with application in the WDM reconfiguration problem

Theoretical Computer Science
Connected searching of weighted trees

Theoretical Computer Science
Guard games on graphs: Keep the intruder out!

Theoretical Computer Science
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
Cop and Robber Games When the Robber Can Hide and Ride

SIAM Journal on Discrete Mathematics
Cops and robber game without recharging

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Edge search number of cographs

Discrete Applied Mathematics
Guard games on graphs: keep the intruder out!

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Pathwidth and searching in parameterized threshold graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Complexity of the cop and robber guarding game

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Variations on Cops and Robbers

Journal of Graph Theory
A graph search algorithm for indoor pursuit/evasion

Mathematical and Computer Modelling: An International Journal
To satisfy impatient web surfers is hard

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Connected graph searching

Information and Computation
Locating a robber on a graph via distance queries

Theoretical Computer Science
Approximate search strategies for weighted trees

Theoretical Computer Science
POLISH-Let us play the cleaning game

Theoretical Computer Science
Some remarks on cops and drunk robbers

Theoretical Computer Science
Computability of width of submodular partition functions

European Journal of Combinatorics
Integer programming models and algorithms for the graph decontamination problem with mobile agents

Networks
Efficient algorithms for pursuing moving evaders in terrains

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hierarchical visibility for guaranteed search in large-scale outdoor terrain

Autonomous Agents and Multi-Agent Systems
On the computational complexity of a game of cops and robbers

Theoretical Computer Science
Capture bounds for visibility-based pursuit evasion

Proceedings of the twenty-ninth annual symposium on Computational geometry
Multi-UAV motion planning for guaranteed search

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Optimal patrolling of fragmented boundaries

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Three-fast-searchable graphs

Discrete Applied Mathematics
On Confinement of the Initial Location of an Intruder in a Multi-robot Pursuit Game

Journal of Intelligent and Robotic Systems
The guarding game is E-complete

Theoretical Computer Science

Quantified Score

Hi-index	5.24

Visualization

Abstract

Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In this annotated bibliography, we give an elementary classification of problems and results related to graph searching and provide a source of bibliographical references on this field.