DeepAI
Log In Sign Up

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs

04/27/2022
by   David Auger, et al.
0

A rotor walk in a directed graph can be thought of as a deterministic version of a Markov Chain, where a pebble moves from vertex to vertex following a simple rule until a terminal vertex, or sink, is reached. The ARRIVAL problem, as defined by Dohrau and al., consists in determining which sink will be reached. While the walk itself can take an exponential number of steps, this problem belongs to the complexity class NP∩co-NP without being known to be in P. Several variants have been studied where we add one or two players to the model, defining deterministic analogs of stochastic models (e.g., Markovian decision processes, Stochastic Games) with rotor-routing rules instead of random transitions. The corresponding decision problem address the existence of strategies for players that ensure some condition on the reached sink. These problems are known to be NP-complete for one player and PSPACE-complete for two players. In this work, we define a class of directed graphs, namely tree-like multigraphs, which are multigraphs having the global shape of an undirected tree. We prove that the different variants of the reachability problem with zero, one, or two players can be solved in linear time, while the number of steps of rotor walks can still be exponential. To achieve this, we define a notion of return flow, which counts the number of times the pebble will bounce back in subtrees of the graph.

READ FULL TEXT

page 3

page 5

page 7

page 9

page 17

page 19

page 21

page 25

02/12/2021

A Subexponential Algorithm for ARRIVAL

The ARRIVAL problem is to decide the fate of a train moving along the ed...
03/04/2021

Computing Subset Feedback Vertex Set via Leafage

Chordal graphs are characterized as the intersection graphs of subtrees ...
03/19/2018

Õ(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem

The directed graph reachability problem takes as input an n-vertex direc...
08/20/2021

On the Computational Complexities of Various Geography Variants

Generalized Geography is a combinatorial game played on a directed graph...
02/11/2019

Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems

Given an orthogonal connected arrangement of line-segments, Minimum Corr...
02/21/2018

ARRIVAL: Next Stop in CLS

We study the computational complexity of ARRIVAL, a zero-player game on ...