Computing the domination number of grid graphs
From MaRDI portal
Recommendations
Cited in
(41)- Efficient domination in grid graphs
- scientific article; zbMATH DE number 637533 (Why is no real title available?)
- The domination numbers of the 5 × n and 6 × n grid graphs
- scientific article; zbMATH DE number 139923 (Why is no real title available?)
- Strong restrained domination number on trees and product of graphs: An algorithmic approach
- An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
- scientific article; zbMATH DE number 1990832 (Why is no real title available?)
- scientific article; zbMATH DE number 4053037 (Why is no real title available?)
- A note on power domination in grid graphs
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- Domination of graphs in \(\mathbf{Z}^{n}_{p}\) and in \(\mathbf{Z}^{n}_{3} \times \mathbf{Z}^{m}_{2}\)
- Learn to solve dominating set problem with GNN and reinforcement learning
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- On \((t,r)\) broadcast domination numbers of grids
- Total domination of grid graphs
- The 2-domination and Roman domination numbers of grid graphs
- Partial domination -- the isolation number of a graph
- scientific article; zbMATH DE number 4039319 (Why is no real title available?)
- Number of dominating sets in cylindric square grid graphs
- Independent transversal domination in trees, products and under local changes to a graph
- Variants of the domination number for flower snarks
- Product throttling
- Split domination of Cartesian product graphs
- Grid graphs, Gorenstein polytopes, and domino stackings
- Independent domination of grids
- Saturated domino coverings
- The secure domination number of Cartesian products of small graphs with paths and cycles
- Binary programming formulations for the upper domination problem
- scientific article; zbMATH DE number 734463 (Why is no real title available?)
- scientific article; zbMATH DE number 7666852 (Why is no real title available?)
- The domination complexity and related extremal values of large 3D torus
- A new distributed algorithm for computing a dominating set on grids
- Independent [1,2]-domination of grids via min-plus algebra
- A general lower bound for the domination number of cylindrical graphs
- Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- scientific article; zbMATH DE number 5238980 (Why is no real title available?)
- Thresholds for the monochromatic clique transversal game
- scientific article; zbMATH DE number 2114690 (Why is no real title available?)
- scientific article; zbMATH DE number 7583648 (Why is no real title available?)
- On the advice complexity of the online dominating set problem
This page was built for publication: Computing the domination number of grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553994)
