Minesweeper on graphs
type: Item
instance of: scholarly article
title: Minesweeper on graphs
zbMATH Open document ID: 1208.91027
author: Shahar Golan
published in: Applied Mathematics and Computation
publication date: 2011-03-28T00:00:00Z
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5870927
zbMATH Keywords: minesweeper
zbMATH Keywords: counting problem
zbMATH Keywords: consistency
zbMATH Keywords: treewidth
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: CSP
zbMATH Keywords: generating polynomials
zbMATH Keywords: dynamic programming
MaRDI profile type: MaRDI publication profile
full work available at URL: j.amc.2011.01.046
OpenAlex ID: W2070641010
cites work: How cellular automaton plays minesweeper
cites work: Minesweeper is NP-complete.
cites work: Littlewood polynomials with high order zeros
cites work: Equal moments division of a set
cites work: ‘Minesweeper’ and spectrum of discrete Laplacians
cites work: The Minesweeper Game: Percolation and Complexity
cites work: Q4291429
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Treewidth. Computations and approximations
DOI: 10.1016/J.AMC.2011.01.046
description: scientific article; zbMATH DE number 5870927