Learn More
We study a turn-based game in a simply connected polygonal environment Q between a pursuer P and an adversarial evader E. Both players can move in a straight line to any point within unit distance during their turn. The pursuer P wins by capturing the evader, meaning that their distance satisfies d(P, E) ≤ 1, while the evader wins by eluding capture(More)
Graphs are a collection of vertices and edges that connect some vertices to others. Signed graphs are graphs whose edges are assigned positive or negative labels and may contain loops. Signed graphs have been useful in understanding phenomena that occur in our society, such as interactions within a group of individuals or the representation of biological(More)
  • 1