"Graphs Partitioning: An Optimal MIMD Queueless Routing for ..."

Jean-Pierre Jung, Ibrahima Sakho (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-14390-8_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ppam/JungS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppam/JungS09
Jean-Pierre Jung, Ibrahima Sakho:
Graphs Partitioning: An Optimal MIMD Queueless Routing for BPC-Permutations on Hypercubes. PPAM (1) 2009: 21-30

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.