DeepAI AI Chat
Log In Sign Up

A Subexponential Algorithm for ARRIVAL

by   Bernd Gärtner, et al.
ETH Zurich

The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in NP ∩ coNP but not known to be in P. The currently best algorithms have runtime 2^Θ(n) where n is the number of vertices. This is not much better than just performing the pseudorandom walk. We develop a subexponential algorithm with runtime 2^O(√(n)log n). We also give a polynomial-time algorithm if the graph is almost acyclic. Both results are derived from a new general approach to solve ARRIVAL instances.


page 1

page 2

page 3

page 4


A simple lower bound for ARRIVAL

The ARRIVIAL problem introduced by Dohrau, Gärtner, Kohler, Matoušek and...

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs

A rotor walk in a directed graph can be thought of as a deterministic ve...

The Stochastic Arrival Problem

We study a new modification of the Arrival problem, which allows for nod...

Online Graph Matching Problems with a Worst-Case Reassignment Budget

In the online bipartite matching with reassignments problem, an algorith...

ARRIVAL: Next Stop in CLS

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

A weighted graph zeta function involved in the Szegedy walk

We define a new weighted zeta function for a finite graph and obtain its...

Fast deterministic tourist walk for texture analysis

Deterministic tourist walk (DTW) has attracted increasing interest in co...