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 …

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 …

Incremental algorithms are important to dynamic graph analyses, but are hard to write and
analyze. Few incremental graph algorithms are in place, and even fewer offer performance …

Minimum Spanning Tree (MST) is a fundamental structure in graph analytics and can be
applied in various applications. The problem of maintaining MSTs in dynamic graphs is …

Structural diversity of a vertex refers to the diversity of connections within its neighborhood
and has been applied in various fields such as viral marketing and user engagement. The …

We survey graph reachability indexing techniques for efficient processing of graph
reachability queries in two types of popular graph models: plain graphs and edge-labeled …

With the advent of the big data era, accelerating the parallelization of Depth‐First Search
(DFS) has become pivotal for addressing the challenges posed by large‐scale datasets and …

Cache efficiency is an important factor in the performance of graph processing due to the
irregular memory access patterns caused by the sparse nature of graphs. To increase the …

In this thesis we develop a package of generic methods for boosting the velocity of graph
computations, regarding partitioning and incrementalization. The former is to deal with the …

Let a network of time series be a set of nodes assuming an underlying network structure,
where each node is associated with a discrete time series. The road network, the human …