Reversibility properties of the fire-fighting problem in graphs (Q1693325): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2017.10.003 / rank
Normal rank
 
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.comgeo.2017.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2766073348 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2017.10.003 / rank
 
Normal rank

Latest revision as of 04:11, 11 December 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
    0 references
    12 February 2018
    0 references
    fire-fighting
    0 references
    lion-and-man problem
    0 references
    offline search
    0 references

    Identifiers