In this paper, we present, to our knowledge, the first known I/O efficient solutions for
computing the k-bisimulation partition of a massive directed graph, and performing …

Bisimulation is a basic graph reduction operation, which plays a key role in a wide range of
graph analytical applications. While there are many algorithms dedicated to computing …

Computing the bisimulation partition of a graph is a fundamental problem which plays a key
role in a wide range of basic applications. Intuitively, two nodes in a graph are bisimilar if …

Massive graphs are becoming increasingly common in a variety of domains such as social
networks and web analytics. One approach to overcoming the challenges of size is to …

Bisimulation summaries of graph data have multiple applications, including facilitating graph
exploration and enabling query optimization techniques, but efficient, scalable, summary …

In this demonstration paper, we present the Graph Based Benchmark Suite (GBBS), a suite
of scalable, provably-efficient implementations of over 20 fundamental graph problems for …

We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph
that changes over time due to the addition of edges. When new edges are added to the …

Graph processing systems are used in a wide variety of fields, ranging from biology to social
networks, and a large number of such systems have been described in the recent literature …

Recent studies showed that single-machine graph processing systems can be as highly
competitive as cluster-based approaches on large-scale problems. While several out-of-core …

The Subgraph Bisimulation Problem Page 1 The Subgraph Bisimulation Problem Agostino
Dovier and Carla Piazza Abstract—We study the complexity of the Subgraph Bisimulation …