2 citations · 3 across the 12 of their papers we have counts for
1 paper · 1 filter
Yaowei Long, Thatchaphol Saranurak
We revisit the vertex-failure connectivity oracle problem. This is one of the most basic graph data structure problems under vertex updates, yet its complexity is still not well-un…