An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version)

Qing Chen, Michael H. Böhlen, Sven Helmer

During the past decades significant efforts have been made to propose data structures for answering connectivity queries on fully dynamic graphs, i.e., graphs with frequent inserti…