Recontamination does not help to search a graph
From MaRDI portal
Recommendations
- Graph searching problems with the counteraction
- scientific article; zbMATH DE number 2233648
- scientific article; zbMATH DE number 2220912
- An analysis of repeated graph search
- scientific article; zbMATH DE number 2102754
- scientific article; zbMATH DE number 1953084
- scientific article; zbMATH DE number 4135984
- Regular graphs are not universal fixers
- scientific article; zbMATH DE number 1538872
- Binary search in graphs revisited
Cited in
(98)- Graph searching with advice
- Edge searching weighted graphs
- Sweeping graphs with large clique number
- Min Cut is NP-complete for edge weighted trees
- Quickly excluding a forest
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- Improved self-reduction algorithms for graphs with bounded treewidth
- Fugitive-search games on graphs and related parameters
- Helicopter search problems, bandwidth and pathwidth
- On the monotonicity of games generated by symmetric submodular functions.
- Edge and node searching problems on trees
- The capture time of a planar graph
- How many lions are needed to clear a grid?
- Finite graph automata for linear and boundary graph languages
- On the domination search number
- Searching and pebbling
- Directed tree-width
- Approximate search strategies for weighted trees
- On tradeoffs between width- and fill-like graph parameters
- Lions and contamination, triangular grids, and Cheeger constants
- The localization capture time of a graph
- Searching for an intruder on graphs and their subdivisions
- Four-searchable biconnected outerplanar graphs
- Cooperative exploration and protection of a workspace assisted by information networks
- Contiguous search problem in Sierpiński graphs
- Zero-visibility cops and robber and the pathwidth of a graph
- Complexity of node coverage games
- The cost of monotonicity in distributed graph searching
- A robber locating strategy for trees
- Locating a robber with multiple probes
- Monotonicity of strong searching on digraphs
- A distributed algorithm for computing the node search number in trees
- Three-fast-searchable graphs
- Lower bounds on the pathwidth of some grid-like graphs
- Lions and contamination: monotone clearings
- Fast searching on cactus graphs
- Network decontamination with a single agent
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- When is a network epidemic hard to eliminate?
- Contraction obstructions for connected graph searching
- On the monotonicity of process number
- Mixed search number and linear-width of interval and split graphs
- LIFO-search on digraphs: a searching game for cycle-rank
- Decontamination of hypercubes by mobile agents
- More agents may decrease global work: a case in butterfly decontamination
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Mixed Search Number of Permutation Graphs
- Monotonicity of Non-deterministic Graph Searching
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- INTRUDER CAPTURING IN MESH AND TORUS NETWORKS
- On minimum cost edge searching
- Fast-mixed searching and related problems on graphs
- Fast searching games on graphs
- Edge search number of cographs
- Searching expenditure and interval graphs
- Graph automata for linear graph languages
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- On the Cooperative Graph Searching Problem
- Visibility-based pursuit-evasion in a polygonal environment
- Digraph Decompositions and Monotonicity in Digraph Searching
- Edge Search Number of Cographs in Linear Time
- Pathwidth is NP-Hard for Weighted Trees
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- On-line search in two-dimensional environment
- Recognizing hyperelliptic graphs in polynomial time
- Computing the vertex separation of unicyclic graphs
- Connected search for a lazy robber
- Edge searching and fast searching with constraints
- Fugitive-search games on graphs and related parameters
- Fast edge searching and fast searching on graphs
- Digraph decompositions and monotonicity in digraph searching
- Graph searching on chordal graphs
- Constrained graph searching on trees
- The zero-visibility cops and robber game on graph products
- Mixed searching and proper-path-width
- Pathwidth of 2-layer k-planar graphs
- Connected graph searching
- Further results on the hunters and rabbit game through monotonicity
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Monotonicity of the cops and robber game for bounded depth treewidth
- A property of random walks on a cycle graph
- On minimizing width in linear layouts
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
- Strong-mixed searching and pathwidth
- Network decontamination under m-immunity
- Monotonicity of non-deterministic graph searching
- An annotated bibliography on guaranteed graph searching
- Distributed chasing of network intruders
- Digraph searching, directed vertex separation and directed pathwidth
- Monotonicity in digraph search problems
- Connected graph searching in chordal graphs
- A graph search algorithm for indoor pursuit/evasion
- CSP duality and trees of bounded pathwidth
- Maximum vertex occupation time and inert fugitive: Recontamination does help
- Monotony properties of connected visible graph searching
This page was built for publication: Recontamination does not help to search a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286162)
