The guarding game is E-complete (Q389949): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080925544 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105337610 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1112.6140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to guard a graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuing a fast robber on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guard games on graphs: keep the intruder out! / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pursuit on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for eternal dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eternally secure sets, independence sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers is EXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of a game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop-robber guarding game with cycle robber-region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results about pursuit games on metric spaces obtained through graph theory techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Cop and Robber Guarding Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Guarding Problem – Complexity and Approximation / rank
 
Normal rank

Latest revision as of 07:00, 7 July 2024

scientific article
Language Label Description Also known as
English
The guarding game is E-complete
scientific article

    Statements

    The guarding game is E-complete (English)
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    pursuit game
    0 references
    cops-and-robber game
    0 references
    graph guarding game
    0 references
    computational complexity
    0 references
    E-completeness
    0 references
    games on propositional formulas
    0 references
    0 references
    0 references
    0 references