Lions and contamination: Monotone clearings

IF 0.4 4区计算机科学 Q4 MATHEMATICS

Computational Geometry-Theory and Applications Pub Date : 2023-03-01 DOI:10.1016/j.comgeo.2022.101961

Daniel Bertschinger, Meghana M. Reddy , Enrico Mann

引用次数: 0

Abstract

We consider a special variant of a pursuit-evasion game called lions and contamination. In a graph whose vertices are originally contaminated, a set of lions walks around the graph and each lion clears the contamination from every vertex it visits. The contamination, however, simultaneously spreads to any adjacent vertex not occupied by a lion. We study the relationship between different types of clearings of graphs, such as clearings which do not allow recontamination, clearings where at most one lion moves at each time step and clearings where lions are forbidden to be stacked on the same vertex. We answer several questions raised by Adams et al. [1].

查看原文本刊更多论文

狮子与污染：单色清除

我们考虑一种特殊的逃避追捕游戏变体，叫做狮子和污染。在顶点最初受到污染的图中，一组狮子在图中行走，每只狮子都会清除其访问的每个顶点的污染。然而，污染同时蔓延到任何没有狮子占据的相邻顶点。我们研究了不同类型的图的清除之间的关系，例如不允许再污染的清除，每个时间步长最多有一只狮子移动的清除，以及禁止狮子堆叠在同一顶点的清除。我们回答了Adams等人[1]提出的几个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computational Geometry-Theory and Applications 数学-数学

CiteScore

1.60

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems. Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.