1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, 1994, Efficient routing and scheduling algorithms for optical networks, Proc. of the 5th ACM–SIAM Symposium on Discrete Algorithms, 412, 423
2. Y. Aumann, Y. Rabani, 1995, Improved bounds for all optical routing, Proc. of the 6th Annual ACM–SIAM Symposium on Discrete Algorithms, 567, 576
3. Mathematical Theory of Connecting Networks and Telephone Traffic;Beneš,1965
4. Graphs and Hypergraphs;Berge,1973
5. Applications of matching and edge-coloring algorithms to routing in clos networks;Carpinelli;Networks,1994