Minimum dominating set of queens: a trivial programming exercise? (Q968146): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence for knights on hexagon and triangle boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exact Algorithms for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for queens domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chessboard domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent queens covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fast Searching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Search Number of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Values of domination numbers of the queen's graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounds for a board covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified solution of the n queens' problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming solution to the \(n\)-queens problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed searching and proper-path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination by queens on a square beehive / rank
 
Normal rank

Latest revision as of 19:42, 2 July 2024

scientific article
Language Label Description Also known as
English
Minimum dominating set of queens: a trivial programming exercise?
scientific article

    Statements

    Minimum dominating set of queens: a trivial programming exercise? (English)
    0 references
    0 references
    5 May 2010
    0 references
    0 references
    exact algorithms
    0 references
    parameterized algorithms
    0 references
    \(\mathcal {NP}\)-completeness
    0 references
    chess problems
    0 references
    domination problems
    0 references
    0 references