This paper presents a scalable high-performance software library to be used for graph
analysis and data mining. Large combinatorial graphs appear in many applications of high …

Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

Complex social and information network search becomes important with a variety of
applications. In the core of these applications, lies a common and critical problem: Given a …

Graph is a significant data structure that describes the relationship between entries. Many
application domains in the real world are heavily dependent on graph data. However, graph …

We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph
framework for exploratory study and partitioning of large-scale networks. To illustrate the …

We present the software library Stxxl that is an implementation of the C++ standard template
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …

We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …

Computing the reachability between two vertices in a graph is a fundamental problem in
graph data analysis. Most of the existing works assume that the edges in the graph have no …

We propose a novel disk-based index for processing single-source shortest path or distance
queries. The index is useful in a wide range of important applications (eg, network analysis …

Given an arbitrary viewpoint v and a terrain, the visibility map or viewshed of v is the set of
points in the terrain that are visible from v. In this article we consider the problem of …