Reversibility properties of the fire-fighting problem in graphs
Author:
- 1 January 2018
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 67, 38-41
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- How Many Lions Are Needed to Clear a Grid?Algorithms, 2009
- Escaping offline searchers and isoperimetric theoremsComputational Geometry, 2009
- Offline variants of the “lion and man” problemTheoretical Computer Science, 2008