Fast searching games on graphs
From MaRDI portal
Publication:411259
DOI10.1007/s10878-010-9328-4zbMath1237.91057OpenAlexW2076264749MaRDI QIDQ411259
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9328-4
Related Items (8)
Fast-mixed searching and related problems on graphs ⋮ Fast searching on \(k\)-combinable graphs ⋮ Edge searching and fast searching with constraints ⋮ Fast Searching on Complete k-partite Graphs ⋮ Fast searching on cactus graphs ⋮ Fast Searching on Cartesian Products of Graphs ⋮ The fast search number of a Cartesian product of graphs ⋮ The fast search number of a complete \(k\)-partite graph
Cites Work
- Unnamed Item
- Cleaning a network with brushes
- An annotated bibliography on guaranteed graph searching
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- Some pursuit-evasion problems on grids
- Fugitive-search games on graphs and related parameters
- Searching and pebbling
- Lower bounds on the pathwidth of some grid-like graphs
- Topological Bandwidth
- The complexity of searching a graph
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Monotonicity in graph searching
- Cleaning Regular Graphs with Brushes
- Recontamination does not help to search a graph
- Eavesdropping games
- A 3-approximation for the pathwidth of Halin graphs
This page was built for publication: Fast searching games on graphs