You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
Graphs Partitioning: An Optimal MIMD Queueless Routing for BPC-Permutations on Hypercubes
|
---|---|
Chapter number | 3 |
Book title |
Parallel Processing and Applied Mathematics
|
Published by |
Springer, Berlin, Heidelberg, September 2009
|
DOI | 10.1007/978-3-642-14390-8_3 |
Book ISBNs |
978-3-64-214389-2, 978-3-64-214390-8
|
Authors |
Jean-Pierre Jung, Ibrahima Sakho, Jung, Jean-Pierre, Sakho, Ibrahima |