The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …

This paper presents the Parallel BGL, a generic C++ library for distributed graph
computation. Like the sequential Boost Graph Library (BGL) upon which it is based, the …

Many emerging large-scale data science applications require searching large graphs
distributed across multiple memories and processors. This paper presents a distributed …

Graph abstractions are extensively used to understand and solve challenging computational
problems in various scientific and engineering domains. They have particularly gained …

Graph analytics delivers deep knowledge by processing large volumes of highly connected
data. In real-world graphs, the degree distribution tends to follow the power law--a small …

viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …

The single-source shortest path (SSSP) problem is one of the most important and well-
studied graph problems widely used in many application domains, such as road navigation …

In spite of intensive research, little progress has been made towards fast and work-efficient
parallel algorithms for the single source shortest path problem. Our Δ-stepping algorithm, a …

Pathfinding is a fundamental problem for many areas, eg, robotics, automation, computer-
aided design, and computer graphics. Although outdoor pathfinding is fledged, indoor …

We present a new scheme for computing shortest paths on real-weighted undirected graphs
in the fundamental comparison-addition model. In an efficient preprocessing phase our …