A cops and robber game and the meeting time of synchronous directed walks
From MaRDI portal
Publication:6599064
DOI10.1002/NET.22234MaRDI QIDQ6599064
Alessandro Maddaloni, Walid Ben-Ameur
Publication date: 5 September 2024
Published in: Networks (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Meeting times of random walks on graphs
- Bounds on the length of a game of cops and robbers
- Exact computation for meeting times and infection times of random walks on graphs
- How to hunt an invisible rabbit on a graph
- An annotated bibliography on guaranteed graph searching
- Digraph searching, directed vertex separation and directed pathwidth
- The capture time of a graph
- Interval graphs and searching
- The vertex separation number of a graph equals its path-width
- Graph searching and a min-max theorem for tree-width
- Hunting rabbits on the hypercube
- On the computational complexity of a game of cops and robbers
- Finding a princess in a palace: a pursuit-evasion problem
- A tight lower bound for the capture time of the cops and robbers game
- Pursuing a fast robber on a graph
- Directed path-width and monotonicity in digraph searching
- Graph searching and interval completion
- DAG-width
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- The Burning Number of Directed Graphs: Bounds and Computational Complexity
- DAG-Width and Parity Games
- The no-meet matroid
- Recontamination helps a lot to hunt a rabbit
This page was built for publication: A cops and robber game and the meeting time of synchronous directed walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599064)