46 citations · 67 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Dynamic graph connectivity with improved worst case update time and sublinear space
David Gibb, Bruce Kapron, Valerie King +1
This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: give…
cs.DC2015★ 7 cited
Construction and impromptu repair of an MST in a distributed network with o(m) communication
Valerie King, Shay Kutten, Mikkel Thorup
In the CONGEST model, a communications network is an undirected graph whose nodes are processors and whose edges are the communications links between processors. At any giv…