Linear Time Algorithm for Update Games via Strongly-Trap-Connected Components

Abstract

An arena is a finite directed graph whose vertices are divided into two classes, i.e., V = V ∪ V#; this forms the basic playground for a plethora of 2-player infinite pebble-games. We introduce and study a refined notion of reachability for arenas, named trap-reachability, where Player attempts to reach vertices without leaving a prescribed subset V ′ ⊆ V… (More)

Topics

3 Figures and Tables