"Work efficient parallel algorithms for large graph exploration on emerging ..."

Dip Sankar Banerjee et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.JPDC.2014.11.006

access: closed

type: Journal Article

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jpdc/BanerjeeKCSK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/BanerjeeKCSK15
Dip Sankar Banerjee, Ashutosh Kumar, Meher Chaitanya, Shashank Sharma, Kishore Kothapalli:
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures. J. Parallel Distributed Comput. 76: 81-93 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.