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 …

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 …

Efficiently solving the traffic assignment problem (TAP) for large-scale transport networks is a
critical problem for transportation studies. Most of the existing algorithms for TAP are serial …

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 …

Shortest path algorithms are required by several transportation applications; furthermore, the
shortest path computation in these applications can account for a large percentage of the …

This paper describes the parallel implementation of a transport network model. A 'Single-
Program, Multiple Data'(SPMD) paradigm is employed using a simple data decomposition …

We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP)
problem on graphs with n nodes and m edges with nonnegative random weights. All …