Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Tsokaktsis, Daniel"'
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 $O(nh)$ space and $O(h)$ query time, where $h$ is the height of a deco
Externí odkaz:
http://arxiv.org/abs/2311.00854
