Dynamic graph connectivity with improved worst case update time and sublinear space.

David Gibb Bruce M. Kapron Valerie King Nolan Thorn

Published in: CoRR (2015)

Keyphrases

computational complexity
worst case
graph connectivity
error bounds
space complexity
lower bound
dynamic environments
dynamically updated