scientific article; zbMATH DE number 7559442
From MaRDI portal
Publication:5089244
Recommendations
- scientific article; zbMATH DE number 7724250
- Cops and an insightful robber
- Cops, robber and traps
- Cops and robbers is EXPTIME-complete
- Cops and robber with constraints
- scientific article; zbMATH DE number 6180528
- scientific article; zbMATH DE number 5241699
- Even time constraints on the watchman's walk
- COPS OR ROBBERS — A BISTABLE SOCIETY
Cites work
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- A game of cops and robbers on graphs with periodic edge-connectivity
- A partial k-arboretum of graphs with bounded treewidth
- An annotated bibliography on guaranteed graph searching
- Connectivity and inference problems for temporal networks
- DAG-Width and Parity Games
- Descriptional and computational complexity of finite automata -- a survey
- Digraph measures: Kelly decompositions, games, and orderings
- Directed path-width and monotonicity in digraph searching
- Directed tree-width
- Fundamentals of parameterized complexity
- Gibbs measures and dismantlable graphs
- Graph searching and a min-max theorem for tree-width
- Graph searching games and width measures for directed graphs
- Knapsack problems: a parameterized point of view
- Parameterized algorithms
- Problems on finite automata and the exponential time hypothesis
- Temporal vertex cover with a sliding time window
- The smallest graph variety containing all paths
- The temporal explorer who returns to the base
- Vertex-to-vertex pursuit in a graph
Cited in
(4)
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 Q5089244)
