Pages that link to "Item:Q553994"

The following pages link to Computing the domination number of grid graphs (Q553994):

Displaying 34 items.

• A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
• Independent [1,2]-domination of grids via min-plus algebra (Q510530) (← links)
• Grid graphs, Gorenstein polytopes, and domino stackings (Q844215) (← links)
• The domination complexity and related extremal values of large 3D torus (Q1791110) (← links)
• On the advice complexity of the online dominating set problem (Q1998864) (← links)
• Number of dominating sets in cylindric square grid graphs (Q2042212) (← links)
• The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
• Product throttling (Q2073191) (← links)
• Independent transversal domination in trees, products and under local changes to a graph (Q2172837) (← links)
• A general lower bound for the domination number of cylindrical graphs (Q2305647) (← links)
• Independent domination of grids (Q2342624) (← links)
• On \((t,r)\) broadcast domination numbers of grids (Q2348050) (← links)
• Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths (Q2419091) (← links)
• A note on power domination in grid graphs (Q2492204) (← links)
• Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
• Saturated domino coverings (Q2786919) (← links)
• A New Distributed Algorithm for Computing a Dominating Set on Grids (Q3452568) (← links)
• (Q3777474) (← links)
• (Q3792725) (← links)
• (Q4304569) (← links)
• (Q4326192) (← links)
• (Q4826286) (← links)
• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid (Q4956183) (← links)
• (Q5104253) (← links)
• Partial domination - the isolation number of a graph (Q5162046) (← links)
• (Q5222933) (← links)
• (Q5442366) (← links)
• Product throttling for power domination (Q5883635) (← links)
• Strong restrained domination number on trees and product of graphs: An algorithmic approach (Q6059097) (← links)
• Binary programming formulations for the upper domination problem (Q6080758) (← links)
• Learn to solve dominating set problem with GNN and reinforcement learning (Q6585558) (← links)
• Variants of the domination number for flower snarks (Q6597991) (← links)
• Efficient domination in grid graphs (Q6625100) (← links)
• Domination polynomials of the grid, the cylinder, the torus, and the king graph (Q6635586) (← links)