To satisfy impatient web surfers is hard (Q2437758): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60488410, #quickstatements; #temporary_batch_1708557319324
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084101883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Meyniel's conjecture on the Cops and Robbers game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / 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: Cops and robbers in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers from a distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop and Robber Games When the Robber Can Hide and Ride / 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: Parameterized algorithm for eternal vertex cover / 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: Cops and robber game without recharging / 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: 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: On the computational complexity of a game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Cop Number when the Robber is Fast / 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: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752024 / rank
 
Normal rank

Latest revision as of 11:49, 7 July 2024

scientific article
Language Label Description Also known as
English
To satisfy impatient web surfers is hard
scientific article

    Statements

    To satisfy impatient web surfers is hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    prefetching
    0 references
    cops and robber games
    0 references
    PSPACE-complete
    0 references
    interval graphs
    0 references
    0 references
    0 references