Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening.
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- NA0003525
- OSTI ID:
- 1899675
- Report Number(s):
- SAND2021-13164C; 701920
- Resource Relation:
- Conference: Proposed for presentation at the IPDPS 2022 held May 30-June 3, 2022 in Lyon, France
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening.
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening.
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
Conference
·
2022
·
OSTI ID:2003043
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening.
Conference
·
2022
·
OSTI ID:2002004
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
Conference
·
2017
·
OSTI ID:1511592