Sciweavers

STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 9 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie