Dynamic graph connectivity in polylogarithmic worst case timeBruce M. Kapron, Valerie King, Ben MountjoySODA2013The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence of edge insertions and deletions, answer queries of the form q(a, b):â€¦ (More)