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

@@ Property / DOI @@
-.1016/j.comgeo.2017.10.003
@@ Property / DOI: 10.1016/j.comgeo.2017.10.003 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.comgeo.2017.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2766073348
@@ Property / OpenAlex ID: W2766073348 / rank @@
+Normal rank
@@ Property / cites work @@
+How many lions are needed to clear a grid?
@@ Property / cites work: How many lions are needed to clear a grid? / rank @@
+Normal rank
@@ Property / cites work @@
+Escaping offline searchers and isoperimetric theorems
+Normal rank
@@ Property / cites work @@
+Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning
+Normal rank
@@ Property / DOI @@
+.1016/J.COMGEO.2017.10.003
@@ Property / DOI: 10.1016/J.COMGEO.2017.10.003 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1693325