Reversibility properties of the fire-fighting problem in graphs (Q1693325): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: How many lions are needed to clear a grid? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Escaping offline searchers and isoperimetric theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning / rank | |||
Normal rank | |||
Revision as of 02:29, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reversibility properties of the fire-fighting problem in graphs |
scientific article |
Statements
Reversibility properties of the fire-fighting problem in graphs (English)
0 references
12 February 2018
0 references
fire-fighting
0 references
lion-and-man problem
0 references
offline search
0 references
