We give new deterministic bounds for fully-dynamic graph connectivity. Our
data structure supports updates (edge insertions/deletions) in
O(log2n/loglogn) amortized time and connectivity queries in O(logn/loglogn) worst-case time, where n is the number of vertices of the
graph. This improves the deterministic data structures of Holm, de Lichtenberg,
and Thorup (STOC 1998, J.ACM 2001) and Thorup (STOC 2000) which both have
O(log2n) amortized update time and O(logn/loglogn) worst-case query
time. Our model of computation is the same as that of Thorup, i.e., a pointer
machine with standard AC0 instructions.Comment: To appear at SODA 2013. 19 pages, 1 figur