8 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.DS2008
Worst-case time decremental connectivity and k-edge witness
Andrew Twigg
We give a simple algorithm for decremental graph connectivity that handles edge deletions in worst-case time and connectivity queries in , where is the…
cs.DS2008★ 8 cited
Lower bounds for distributed markov chain problems
Rahul Sami, Andy Twigg
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network with the cave…