Bottleneck Paths Reduce to Deterministic Graphical Games and a Counterexample to a Claimed Linear-Time Algorithm

Abstract

Chechik, Kaplan, Thorup, Zamir, and Zwick (STACS 2016) claimed a simple deterministic linear-time comparison-based algorithm for solving deterministic two-player, turn-based, zero-sum terminal-payoff games, also known as deterministic graphical games (DGGs). We give a counterexample to their algorithm. We also give a deterministic linear-time reduction from the directed $s$-$t$ bottleneck path (BP) problem to the DGG problem. Consequently, a linear-time comparison-based algorithm for computing the value of a designated start vertex in a DGG would yield a linear-time comparison-based algorithm for directed $s$-$t$ BP. Whether directed $s$-$t$ BP admits such an algorithm has remained open since Gabow and Tarjan gave their $\mathcal{O}(m\log^* n)$-time algorithm. Thus, a positive resolution of the open question for DGGs would also resolve the corresponding open question for directed $s$-$t$ BP.