Ordering heuristics for parallel graph coloring

William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson. Ordering heuristics for parallel graph coloring. In Guy E. Blelloch, Peter Sanders, editors, 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014. pages 166-177, ACM, 2014. [doi]

@inproceedings{HasenplaughKSL14,
  title = {Ordering heuristics for parallel graph coloring},
  author = {William Hasenplaugh and Tim Kaler and Tao B. Schardl and Charles E. Leiserson},
  year = {2014},
  doi = {10.1145/2612669.2612697},
  url = {http://doi.acm.org/10.1145/2612669.2612697},
  researchr = {https://researchr.org/publication/HasenplaughKSL14},
  cites = {0},
  citedby = {0},
  pages = {166-177},
  booktitle = {26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014},
  editor = {Guy E. Blelloch and Peter Sanders},
  publisher = {ACM},
  isbn = {978-1-4503-2821-0},
}