BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems.
Conference
·
OSTI ID:1115145
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1115145
- Report Number(s):
- SAND2013-9044C; 477217
- Resource Relation:
- Conference: Proposed for presentation at the IPDPS14 held May 19-23, 2014 in Phoenix, AZ.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel Strongly Connected Components in Shared Memory Architectures.
Computing Strongly Connected Components in Modern Architectures.
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers.
Conference
·
Sat Feb 01 00:00:00 EST 2014
·
OSTI ID:1115145
Computing Strongly Connected Components in Modern Architectures.
Conference
·
Mon Jul 01 00:00:00 EDT 2013
·
OSTI ID:1115145
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers.
Conference
·
Wed Jun 01 00:00:00 EDT 2005
·
OSTI ID:1115145
+2 more