no code implementations • 7 Jan 2021 • Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
In this paper we present an efficient reachability oracle under single-edge or single-vertex failures for planar directed graphs.
Data Structures and Algorithms
