Graph Library

This project grew out of a 2018 graph challenge submission that I was tangentially involved in. In 2019 I took charge of the triangle counting submission, where I implemented a variety of GPU triangle counting approaches. This library contains those implementations, as well as k-truss decompositions written by my colleague Mohammad Almasri. It also contains a fair amount of utility code, including sparse and dense data structures, system topology discovery code and search/load-balancing algorithms.

Carl Pearson
Electrical and Computer Engineering Ph.D. Candidate

PhD Candidate