Spy game: FPT-algorithm, hardness and graph products
From MaRDI portal
Publication:2672629
DOI10.1016/j.tcs.2022.05.015OpenAlexW3207049615MaRDI QIDQ2672629
Rudini Menezes Sampaio, Eurinardo R. Costa, Nícolas A. Martins
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.08898
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restricted coloring problems on graphs with few \(P_4\)'s
- A cops and robber game in multidimensional grids
- Cops and robbers from a distance
- On a generalization of Meyniel's conjecture on the Cops and Robbers game
- A game of cops and robbers
- A tree representation for \(P_ 4\)-sparse graphs
- On the structure of graphs with few \(P_4\)s
- Spy-game on graphs: complexity and simple topologies
- Vertex-to-vertex pursuit in a graph
- Study of a combinatorial game in graphs through linear programming
- Pursuing a fast robber on a graph
- Graphs with equal eternal vertex cover and eternal domination numbers
- Catching a fast robber on the grid
- Tight bounds for eternal dominating sets in graphs
- Fixed-parameter algorithms for the cocoloring problem
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
- Hardness and inapproximability of convex recoloring problems
- Maximization coloring problems on graphs with few \(P_4\)
- Cops and Robber with Constraints
- Algorithmic construction of sets for k -restrictions
- Cop and Robber Games When the Robber Can Hide and Ride
- Cops and Robber Game without Recharging
- Minimum density of identifying codes of king grids
This page was built for publication: Spy game: FPT-algorithm, hardness and graph products
