scientific article; zbMATH DE number 3590298

Cited in

(only showing first 100 items - show all)

Graph searching with advice
A witness version of the cops and robber game
Edge searching weighted graphs
Sweeping graphs with large clique number
Interval graphs and searching
Min Cut is NP-complete for edge weighted trees
Single step graph search problem
Solving the single step graph searching problem by solving the maximum two-independent set problem
The vertex separation number of a graph equals its path-width
Search and sweep numbers of finite directed acyclic graphs
A two-person game on graphs where each player tries to encircle his opponent's men
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
Fugitive-search games on graphs and related parameters
Helicopter search problems, bandwidth and pathwidth
Edge and node searching problems on trees
Algorithms and obstructions for linear-width and related search parameters
Intruder alert! Optimization models for solving the mobile robot graph-clear problem
The capture time of a planar graph
How many lions are needed to clear a grid?
Multiagent cooperative learning strategies for pursuit-evasion games
On a characterization of evasion strategies for pursuit-evasion games on graphs
Zero forcing in iterated line digraphs
Finite graph automata for linear and boundary graph languages
Minimal trees of a given search number
Searching and pebbling
Vertex-to-vertex pursuit in a graph
Directed tree-width
Locating a robber on a graph via distance queries
Guarding a subgraph as a tool in pursuit-evasion games
Lions and contamination, triangular grids, and Cheeger constants
Two-agent tree evacuation
Clearing an orthogonal polygon to find the evaders
Four-searchable biconnected outerplanar graphs
Cooperative exploration and protection of a workspace assisted by information networks
Finding small-width connected path decompositions in polynomial time
Continuous graph partitioning for camera network surveillance
Zero-visibility cops and robber and the pathwidth of a graph
Complexity of node coverage games
Non-deterministic graph searching in trees
The searchlight problem for road networks
Distributed graph searching with a sense of direction
Locating a robber with multiple probes
The theory of guaranteed search on graphs
Three-fast-searchable graphs
Subdivisions in the robber locating game
Lions and contamination: monotone clearings
The mixed search game against an agile and visible fugitive is monotone
Fast searching on cactus graphs
The realizability problem for Golovach-type functions
Pursuit of a moving target with known constant speed on a directed acyclic graph under partial information
Outerplanar obstructions for matroid pathwidth
Network decontamination with a single agent
Mixed search number and linear-width of interval and split graphs
Cooperative pursuit with Voronoi partitions
Robust shortest path planning and semicontractive dynamic programming
A game of cops and robbers on graphs with periodic edge-connectivity
Lower and upper competitive bounds for online directed graph exploration
Jumping robbers in digraphs
Mixed Search Number of Permutation Graphs
Monotonicity of Non-deterministic Graph Searching
Mixed Search Number and Linear-Width of Interval and Split Graphs
Cops and invisible robbers: the cost of drunkenness
On minimum cost edge searching
Outerplanar obstructions for matroid pathwidth
\(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
Edge search number of cographs
Searching expenditure and interval graphs
On the Cooperative Graph Searching Problem
A linear fixed parameter tractable algorithm for connected pathwidth
Visibility-based pursuit-evasion in a polygonal environment
Smarter Lions: efficient cooperative pursuit in general bounded arenas
Line-of-sight pursuit in monotone and scallop polygons
The fast search number of a Cartesian product of graphs
Positive Alexander duality for pursuit and evasion
Edge Search Number of Cographs in Linear Time
Pathwidth is NP-Hard for Weighted Trees
Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
Minimal trees of given search number
scientific article; zbMATH DE number 7651203 (Why is no real title available?)
On-line search in two-dimensional environment
Toward multi-target self-organizing pursuit in a partially observable Markov game
Connected search for a lazy robber
Fast searching on k-combinable graphs
Edge searching and fast searching with constraints
Cops and robber on oriented graphs with respect to push operation
Learning through imitation by using formal verification
Fugitive-search games on graphs and related parameters
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Graph searching on chordal graphs
Constrained graph searching on trees
Graph games and logic design
Zero-visibility cops and robber game on cage graph
On the target pebbling conjecture
The complexity of pursuit on a graph
Mixed searching and proper-path-width
Parameterized analysis of the cops and robber problem
A note on robber locating game
Hunting a rabbit is hard
On the cop number of string graphs
Connected graph searching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159394)