| Title: |
An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Harshvardhan |
-
Texas A&M University, Parasol Laboratory
-
Texas A&M University, Dept. of Computer Science and Engineering
|
| Adam Fidel |
-
Texas A&M University, Parasol Laboratory
-
Texas A&M University, Dept. of Computer Science and Engineering
|
| Nancy M. Amato |
-
Texas A&M University, Parasol Laboratory
-
Texas A&M University, Dept. of Computer Science and Engineering
|
| Lawrence Rauchwerger |
-
Texas A&M University, Parasol Laboratory
-
Texas A&M University, Department of Computer Science and Engineering
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
0702765,
0551685,
0833199,
1439145,
1423111,
0830753,
0917266
|
| DBLP Key: |
conf/IEEEpact/HarshvardhanFAR15
|
| Author Comments: |
|