"Achieving Optimal Inter-Node Communication in Graph Partitioning Using ..."

Srimanth Gadde et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S10766-015-0374-5

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijpp/GaddeARGD16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijpp/GaddeARGD16
Srimanth Gadde, William F. Acosta, Jordan Ringenberg, Robert Green, Vijay K. Devabhaktuni:
Achieving Optimal Inter-Node Communication in Graph Partitioning Using Random Selection and Breadth-First Search. Int. J. Parallel Program. 44(4): 772-800 (2016)

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.