The vertex-centric programming model is an established computational paradigm recently
incorporated into distributed processing frameworks to address challenges in large-scale …

For large-scale graph analytics on the GPU, the irregularity of data access/control flow and
the complexity of programming GPUs have been two significant challenges for developing a …

We present a graph processing benchmark suite with the goal of helping to standardize
graph processing evaluations. Fewer differences between graph processing evaluations will …

We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …

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 …

Mathematical software and graph-theoretical algorithmic packages to efficiently model,
analyze, and query graphs are crucial in an era where large-scale spatial, societal, and …

Graph-structured analytics has been widely adopted in a number of big data applications
such as social computation, web-search and recommendation systems. Though much prior …

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 …

We study the problem of computing all Pareto-optimal journeys in a dynamic public transit
network for multiple criteria, such as arrival time and number of transfers. Existing algorithms …