The theory of guaranteed search on graphs
From MaRDI portal
Publication:2439841
DOI10.3103/S1063454113020027zbMath1283.91020OpenAlexW2055224076MaRDI QIDQ2439841
Publication date: 17 March 2014
Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1063454113020027
Search theory (90B40) Games involving graphs (91A43) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonicity of the search number in the Golovach problem
- Search problems in graphs with counteraction.
- On certain search problems with counteraction.
- Graph minors. III. Planar tree-width
- Some problems of the search on graphs with retaliation
- Search problems in graphs with retaliation
- An annotated bibliography on guaranteed graph searching
- Graph minors. I. Excluding a forest
- Interval graphs and searching
- Graph minors. VI. Disjoint paths across a disc
- Graph minors. V. Excluding a planar graph
- Min Cut is NP-complete for edge weighted trees
- Graph minors. VII: Disjoint paths on a surface
- Graphs with small bandwidth and cutwidth
- Graph minors. X: Obstructions to tree-decomposition
- Narrowness, pathwidth, and their application in natural language processing
- The vertex separation number of a graph equals its path-width
- Some pursuit-evasion problems on grids
- Note on a helicopter search problem on graphs
- Graph minors. XI: Circuits on a surface
- Graph searching and a min-max theorem for tree-width
- Quickly excluding a planar graph
- Search problem on trees
- Some generalizations of the problem on the search number of a graph
- The \(k\)-search number of graphs of regular polyhedra
- Fugitive-search games on graphs and related parameters
- Helicopter search problems, bandwidth and pathwidth
- Nontrivial discontinuities of the Golovach functions for trees
- Arbitrarily large jumps of the Golovach function for trees
- On some problems of guaranteed search on graphs
- Graph minors. IX: Disjoint crossed paths
- Searching and pebbling
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XII: Distance on a surface
- Graph minors. XIV: Extending an embedding
- On some problems of guaranteed search
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Search problems on graphs of regular polyhedra
- Disjoint Paths—A Survey
- Topological Bandwidth
- Graph minors. II. Algorithmic aspects of tree-width
- A polynomial algorithm for the min-cut linear arrangement of trees
- The complexity of searching a graph
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Applications of a Planar Separator Theorem
- Searching for a Mobile Intruder in a Polygonal Region
This page was built for publication: The theory of guaranteed search on graphs
