$2$-Fault-Tolerant Strong Connectivity Oracles

Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis

We study the problem of efficiently answering strong connectivity queries under two vertex failures. Given a directed graph $G$ with $n$ vertices, we provide a data structure with…