In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We provide data strutures that maintain a graph as edges are inserted and deleted, and
keep track of the following properties with the following times: minimum spanning forests …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

We present the results of an extensive computational study on dynamic algorithms for all
pairs shortest path problems. We describe our implementations of the recent dynamic …

In many applications of graph algorithms, including communication networks, graphics,
assembly planning, and VLSI design, graphs are subject to discrete changes, such as …

The contributions of this paper are both of theoretical and of experimental nature. From the
experimental point of view, we conduct an empirical study on some dynamic connectivity …

In this paper we propose the first experimental study of the fully dynamic single-source
shortest-paths problem on directed graphs with positive real edge weights. In particular, we …

We consider graphs whose vertices may be in one of two different states: either on or off. We
wish to maintain dynamically such graphs under an intermixed sequence of updates and …

HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a
hierarchical organization of clusters in a dataset wrt a parameter mpts. While a small change …

HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a
hierarchical organization of clusters in a dataset wrt a parameter mpts. While the …