How to hunt an invisible rabbit on a graph (Q896060): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2015.08.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Randomized Pursuit-Evasion in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Escaping offline searchers and isoperimetric theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a princess in a palace: a pursuit-evasion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / 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: An evasion game on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / 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: A short note about pursuit games played on a graph with a given genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724424 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2015.08.002 / rank
 
Normal rank

Revision as of 07:32, 10 December 2024

scientific article
Language Label Description Also known as
English
How to hunt an invisible rabbit on a graph
scientific article

    Statements

    Identifiers

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