How to hunt an invisible rabbit on a graph (Q896060): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/ejc/AbramovskayaFGP16, #quickstatements; #temporary_batch_1735573089131 |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ejc.2015.08.002 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1855571088 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60488376 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1502.05614 / 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 | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/ejc/AbramovskayaFGP16 / rank | |||
Normal rank |
Latest revision as of 16:38, 30 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to hunt an invisible rabbit on a graph |
scientific article |
Statements
How to hunt an invisible rabbit on a graph (English)
0 references
11 December 2015
0 references
Hunters \& Rabbit game
0 references