Many practical computing problems concern large graphs. Standard examples include the
Web graph and various social networks. The scale of these graphs-in some cases billions of …

Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-
level graph analysis algorithms. It is also representative of a class of parallel computations …

The recent switch to parallel microprocessors is a milestone in the history of computing.
Industry has laid out a roadmap for multicore designs that preserves the programming …

Breadth‐First Search is an important kernel used by many graph‐processing applications. In
many of these emerging applications of BFS, such as analyzing social networks, the input …

Large graphs involving millions of vertices are common in many practical applications and
are challenging to process. Practical-time implementations using high-end computers are …

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 …

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 …

Graphs are powerful data representations favored in many computational domains. Modern
GPUs have recently shown promising results in accelerating computationally challenging …

The increasing importance of graph-data based applications is fueling the need for highly
efficient and parallel implementations of graph analysis software. In this paper we describe …

Graph algorithms are becoming increasingly important for solving many problems in
scientific computing, data mining and other domains. As these problems grow in scale …