The complexity of pursuit on a graph (Q673639): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a pursuit game played on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game played on graphs for which a minor is excluded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Regular Graphs of Girth Six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of problems in games, graphs and algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of annihilation games. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-Hardness of some combinatorial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game on Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a pursuit game on Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Pebble Games and Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a game of policemen and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / 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: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note about pursuit games played on a graph with a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 10:26, 27 May 2024

scientific article
Language Label Description Also known as
English
The complexity of pursuit on a graph
scientific article

    Statements

    The complexity of pursuit on a graph (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    PSPACE completeness
    0 references
    EXPTIME-completeness
    0 references

    Identifiers