Fugitive-search games on graphs and related parameters
From MaRDI portal
Publication:1392025
DOI10.1016/S0304-3975(96)00177-6zbMATH Open0903.68052OpenAlexW2072099942MaRDI QIDQ1392025FDOQ1392025
Authors: Nick D. Dendris, L. M. Kirousis, Dimitrios M. Thilikos 
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00177-6
Recommendations
- Fugitive-search games on graphs and related parameters
- Pursuit—Evasion games on graphs
- On evasion games on graphs
- Monotonicity and inert fugitive search games
- Finding a moving fugitive. A game theoretic representation of search
- Static search games played over graphs and general metric spaces
- An invitation to pursuit-evasion games and graph theory
- scientific article; zbMATH DE number 1151792
- On a pursuit game on Cayley graphs
- Fast searching games on graphs
Cites Work
- Graph searching and a min-max theorem for tree-width
- Treewidth for graphs with small chordality
- Searching and pebbling
- A Sufficient Condition for Backtrack-Free Search
- Title not available (Why is that?)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- Quickly excluding a forest
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- The vertex separation number of a graph equals its path-width
- The vertex separation and search number of a graph
- Monotonicity in graph searching
- The Pathwidth and Treewidth of Cographs
- Title not available (Why is that?)
- Graph minors. III. Planar tree-width
- Tree clustering for constraint networks
- Interval graphs and searching
- A sufficient condition for backtrack-bounded search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Linkage of a Graph
- TREEWIDTH OF CIRCLE GRAPHS
Cited In (56)
- Searching expenditure and interval graphs
- Edge-treewidth: algorithmic and combinatorial properties
- Fast searching games on graphs
- Title not available (Why is that?)
- Fugitive-search games on graphs and related parameters
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- The dag-width of directed graphs
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Connected graph searching in chordal graphs
- A note on exact algorithms for vertex ordering problems on graphs
- On tradeoffs between width- and fill-like graph parameters
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- An annotated bibliography on guaranteed graph searching
- Digraph measures: Kelly decompositions, games, and orderings
- Searching for a Visible, Lazy Fugitive
- Maximum vertex occupation time and inert fugitive: Recontamination does help
- Decontamination of hypercubes by mobile agents
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth for graphs with small chordality
- The mixed search game against an agile and visible fugitive is monotone
- Contraction obstructions for connected graph searching
- Digraph Decompositions and Monotonicity in Digraph Searching
- Monotonicity of strong searching on digraphs
- Graph Searching in a Crime Wave
- Monotonicity of Non-deterministic Graph Searching
- On the domination search number
- Linear rank-width and linear clique-width of trees
- Time constrained graph searching
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- Minimum rank and zero forcing number for butterfly networks
- Monotonicity of non-deterministic graph searching
- LIFO-search on digraphs: a searching game for cycle-rank
- Digraph searching, directed vertex separation and directed pathwidth
- Monotony properties of connected visible graph searching
- On the monotonicity of games generated by symmetric submodular functions.
- Directed elimination games
- Directed path-width and monotonicity in digraph searching
- Algorithms and obstructions for linear-width and related search parameters
- Approximation algorithms for digraph width parameters
- The theory of guaranteed search on graphs
- Spy game: FPT-algorithm, hardness and graph products
- Digraph decompositions and monotonicity in digraph searching
- All structured programs have small tree width and good register allocation
- Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
- The complexity of minimum-length path decompositions
- Connected search for a lazy robber
- Contiguous search problem in Sierpiński graphs
- SOFSEM 2006: Theory and Practice of Computer Science
- Nondeterministic graph searching: from pathwidth to treewidth
- Recognizing digraphs of Kelly-width 2
- Digraphs of bounded elimination width
- A search game on the union of graphs with immobile hider
- Helicopter search problems, bandwidth and pathwidth
- Static search games played over graphs and general metric spaces
- Exclusive graph searching vs. pathwidth
- Finding a moving fugitive. A game theoretic representation of search
This page was built for publication: Fugitive-search games on graphs and related parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392025)
