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 …

There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …

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 …

Various applications model problems as streaming graphs, which need to quickly apply a
stream of updates and run algorithms on the updated graph. Furthermore, many dynamic …

Obtaining scalable algorithms for\emph {hierarchical agglomerative clustering}(HAC) is of
significant interest due to the massive size of real-world datasets. At the same time …

Maintaining a k-core decomposition quickly in a dynamic graph has important applications
in network analysis. The main challenge for designing efficient exact algorithms is that a …

SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely used graph
clustering algorithm. For large graphs, however, sequential SCAN variants are prohibitively …

Many real-world applications operate on dynamic graphs that undergo rapid changes in
their topological structure over time. However, it is challenging to design dynamic algorithms …

Community search (CS) aims at personalized subgraph discovery which is the key to
understanding the organisation of many real-world networks. CS in undirected networks has …

Many real-world applications operate on dynamic graphs to perform important tasks. In this
article, we study batch-dynamic algorithms that are capable of updating distance labelling …