A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00710-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3129946810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithms for generalized Cops and Robbers games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological directions in cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game of cops and eternal robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-visibility cops and robber and the pathwidth of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of zero-visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-cop-moves game on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers is EXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / 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: Q4724424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition approach to lower bounds for zero-visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the one-visibility copnumber of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in digraph search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal capture time of the one-cop-moves game / rank
 
Normal rank

Latest revision as of 15:20, 29 July 2024

scientific article
Language Label Description Also known as
English
A simple method for proving lower bounds in the zero-visibility cops and robber game
scientific article

    Statements

    A simple method for proving lower bounds in the zero-visibility cops and robber game (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    cops and robbers
    0 references
    zero-visibility cops and robber game
    0 references
    pursuit evasion games
    0 references

    Identifiers