Graphs Partitioning: An Optimal MIMD Queueless Routing for BPC-Permutations on Hypercubes

Parallel Processing and Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14390-8_3 ◽

2010 ◽

pp. 21-30 ◽

Cited By ~ 1

Author(s):

Jean-Pierre Jung ◽

Ibrahima Sakho

Download Full-text