Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures. Banerjee, D. S., Kumar, A., Chaitanya, M., Sharma, S., & Kothapalli, K. J. Parallel Distrib. Comput., 76:81--93, 2015.
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures [link]Paper  doi  bibtex   
@article{DBLP:journals/jpdc/BanerjeeKCSK15,
  author    = {Dip Sankar Banerjee and
               Ashutosh Kumar and
               Meher Chaitanya and
               Shashank Sharma and
               Kishore Kothapalli},
  title     = {Work efficient parallel algorithms for large graph exploration on
               emerging heterogeneous architectures},
  journal   = {J. Parallel Distrib. Comput.},
  volume    = {76},
  pages     = {81--93},
  year      = {2015},
  url       = {http://dx.doi.org/10.1016/j.jpdc.2014.11.006},
  doi       = {10.1016/j.jpdc.2014.11.006},
  timestamp = {Mon, 21 Sep 2015 01:00:00 +0200},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/journals/jpdc/BanerjeeKCSK15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

Downloads: 0