Now showing items 1-4 of 4
Parallel Algorithms for Evaluating Centrality Indices in Real-World Networks
(Georgia Institute of Technology, 2006-04-14)
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploit properties typically observed in ...
Parallel Shortest Path Algorithms for Solving Large-Scale Instances
(Georgia Institute of Technology, 2006-08-30)
We present an experimental study of parallel algorithms for solving the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs. We implement Meyer and Sander's Δ-stepping algorithm ...
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
(Georgia Institute of Technology, 2006-02-26)
Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence in recent years for applications ...
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
(Georgia Institute of Technology, 2006-02-25)
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing and computational biology, as well as applications in national security. ...