[引用][C] Eternal vertex cover on bipartite and co-bipartite graphs

J Babu, N Misra, SG Nanoti - 2022

Eternal vertex cover on bipartite and co-bipartite graphs

N Misra, S Nanoti - arXiv preprint arXiv:2201.03820, 2022 - arxiv.org
Eternal Vertex Cover problem is a dynamic variant of the vertex cover problem. We have a
two player game in which guards are placed on some vertices of a graph. In every move,
one player (the attacker) attacks an edge. In response to the attack, the second player
(defender) moves the guards along the edges of the graph in such a manner that at least
one guard moves along the attacked edge. If such a movement is not possible, then the
attacker wins. If the defender can defend the graph against an infinite sequence of attacks …
以上显示的是最相近的搜索结果。 查看全部搜索结果