Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

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

During the last years, several speed-up techniques for Dijkstra's algorithm have been
published that maintain the correctness of the algorithm but reduce its running time for …

We present an experimental study of the single source shortest path problem with non-
negative edge weights (NSSP) on large-scale graphs using the Δ-stepping parallel …

The Single Source Shortest Path (SSSP) problem consists in finding the shortest paths from
a vertex (the source vertex) to all other vertices in a graph. SSSP has numerous …

We demonstrate how Dijkstra's algorithm for shortest path queries can be accelerated by
using precomputed shortest path distances. Our approach allows a completely flexible …

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 …

We present an experimental study of the single source shortest path problem with non-
negative edge weights (NSSP) on large-scale graphs using the∆-stepping parallel …

In today's Internet, the shortest path tree (SPT) construction is an important issue in data
exchange. To forward a data packet, each router uses routing protocols and link state …

We present three lock-free data structures for priority task scheduling: a priority work-stealing
one, a centralized one with ρ-relaxed semantics, and a hybrid one combining both concepts …