Pages that link to "Item:Q673639"
From MaRDI portal
The following pages link to The complexity of pursuit on a graph (Q673639):
Displaying 42 items.
- The guarding game is E-complete (Q389949) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- The complexity of node blocking for dags (Q616455) (← links)
- Static and expanding grid coverage with ant robots: complexity results (Q638536) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- Bounds for cops and robber pursuit (Q991186) (← links)
- The capture time of a graph (Q1045043) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- The lion and man game on polyhedral surfaces with obstacles (Q1643158) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Traveling salesmen in the presence of competition (Q1884998) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Cops that surround a robber (Q2197471) (← links)
- Collaborative pursuit-evasion strategy of UAV/UGV heterogeneous system in complex three-dimensional polygonal environment (Q2205312) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- (Q3305770) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas (Q5111067) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- Cops and robber on some families of oriented graphs (Q5896831) (← links)
- Variations of cops and robbers game on grids (Q5919113) (← links)
