scientific article; zbMATH DE number 1151792
From MaRDI portal
Publication:4387698
zbMATH Open0897.05079MaRDI QIDQ4387698FDOQ4387698
Authors: Fedor V. Fomin, N. N. Petrov 
Publication date: 19 October 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (22)
- Pursuit—Evasion games on graphs
- Search in graphs
- Preface to the special issue on graph searching: theory and applications
- Searching expenditure and interval graphs
- Title not available (Why is that?)
- An annotated bibliography on guaranteed graph searching
- A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
- Searching for a Visible, Lazy Fugitive
- Searching for an evader in an unknown graph by an optimal number of searchers
- Monotonicity of strong searching on digraphs
- On the domination search number
- Digraph searching, directed vertex separation and directed pathwidth
- Fast searching on cactus graphs
- Fugitive-search games on graphs and related parameters
- The theory of guaranteed search on graphs
- Escaping offline searchers and isoperimetric theorems
- Connected search for a lazy robber
- Edge degeneracy: algorithmic and structural results
- Pursuit-evasion games on Latin square graphs
- Discrete search programs on graphs
- Helicopter search problems, bandwidth and pathwidth
- Control sequencing in a game of identity pursuit-evasion
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 Q4387698)
