Complexity of the game domination problem (Q313955): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963136883 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.00140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width QBF is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constraint satisfaction games and QCSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game: effect of edge- and vertex-removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game and an Imagination Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game played on trees and spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game: extremal families of graphs for \(3/5\)-conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the game domination number of graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination game critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domination game played on unions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: To satisfy impatient web surfers is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing role assignments of proper interval graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list \(L(2,1)\)-labelings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Game Domination Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2800503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small game domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizations of the game domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of forests with trivial game domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests / rank
 
Normal rank

Revision as of 13:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Complexity of the game domination problem
scientific article

    Statements

    Complexity of the game domination problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    domination game
    0 references
    computational complexity
    0 references
    PSPACE-complete problems
    0 references
    POS-CNF problem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references