Cops and Robber on Oriented Graphs with Respect to Push Operation

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

Graph Searching games are extensively studied in the literature for their vast number of applications in artificial intelligence, robot motion planning, game planning, distributed computing, and graph theory. In particular, Cops and Robber is one of the most well-studied graph searching game, where a set of cops try to capture the position of a single robber. The cop number of a graph is the minimum number of cops required to capture the robber on the graph. In an oriented graph G→, the push operation on a vertex v reverses the orientation of all arcs incident on v. We define and study a variant of the game of Cops and Robber on oriented graphs, where the players also have the ability to push the vertices of the graph.

First Page

309

Last Page

320

DOI

10.1007/978-3-031-25211-2_24

Publication Date

1-1-2023

This document is currently not available here.

Share

COinS