Research NoteTwo-Pass Rearrangeability in Faulty Benes Networks
References (0)
Cited by (2)
O (log m.log N) routing algorithm for (2log N-1) -stage switching networks and beyond
2014, Journal of Parallel and Distributed ComputingLow complexity routing algorithm for rearrangeable switching networks
2013, Proceedings - International Conference on Advanced Information Networking and Applications, AINA
- 1
E-mail: [email protected].
Copyright © 1996 Academic Press. All rights reserved.