Ordered and unordered algorithms for parallel breadth first search

Muhammad Amber Hassaan, Martin Burtscher, Keshav Pingali. Ordered and unordered algorithms for parallel breadth first search. In Valentina Salapura, Michael Gschwind, Jens Knoop, editors, 19th International Conference on Parallel Architecture and Compilation Techniques (PACT 2010), Vienna, Austria, September 11-15, 2010. pages 539-540, ACM, 2010. [doi]

@inproceedings{HassaanBP10,
  title = {Ordered and unordered algorithms for parallel breadth first search},
  author = {Muhammad Amber Hassaan and Martin Burtscher and Keshav Pingali},
  year = {2010},
  doi = {10.1145/1854273.1854341},
  url = {http://doi.acm.org/10.1145/1854273.1854341},
  tags = {search},
  researchr = {https://researchr.org/publication/HassaanBP10},
  cites = {0},
  citedby = {0},
  pages = {539-540},
  booktitle = {19th International Conference on Parallel Architecture and Compilation Techniques (PACT 2010), Vienna, Austria, September 11-15, 2010},
  editor = {Valentina Salapura and Michael Gschwind and Jens Knoop},
  publisher = {ACM},
  isbn = {978-1-4503-0178-7},
}