ECL-GC v1.1


ECL-GC is a graph-coloring algorithm with shortcutting that is very fast. It operates on graphs stored in binary CSR format. Converters to this format can be found here. A few graphs in this format can be found here.

Click on ECL-GC_11.cu and ECLgraph.h to download the source code. Click on one of the links below for a description of ECL-GC. Note that ECL-GC is protected by this license and that by downloading ECL-GC you agree to the terms and conditions set forth in this license.

The source code can be compiled as follows:

nvcc -O3 -arch=sm_35 ECL-GC_11.cu -o ecl-gc

To compute the coloring of the file graph.egr, enter:

./ecl-gc graph.egr

Publications

G. Alabandi, E. Powers, and M. Burtscher. "Increasing the Parallelism of Graph Coloring via Shortcutting." Proceedings of the 2020 ACM Conference on Principles and Practice of Parallel Programming. February 2020. [pdf]

This work has been supported in part by the National Science Foundation under Grant No. 1406304 as well as by equipment donations from Nvidia Corporation.

Official Texas State University Disclaimer