A scalable distance-1 vertex coloring algorithm for power-law graphs

Jesun Sahariar Firoz, Marcin Zalewski, Andrew Lumsdaine. A scalable distance-1 vertex coloring algorithm for power-law graphs. In Andreas Krall, Thomas R. Gross, editors, Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2018, Vienna, Austria, February 24-28, 2018. pages 391-392, ACM, 2018. [doi]

@inproceedings{FirozZL18,
  title = {A scalable distance-1 vertex coloring algorithm for power-law graphs},
  author = {Jesun Sahariar Firoz and Marcin Zalewski and Andrew Lumsdaine},
  year = {2018},
  doi = {10.1145/3178487.3178521},
  url = {http://doi.acm.org/10.1145/3178487.3178521},
  researchr = {https://researchr.org/publication/FirozZL18},
  cites = {0},
  citedby = {0},
  pages = {391-392},
  booktitle = {Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2018, Vienna, Austria, February 24-28, 2018},
  editor = {Andreas Krall and Thomas R. Gross},
  publisher = {ACM},
}