References
- Mario Gerla, Prasasth Palnati, Simon Walton, 'Multicasting Protocols for High-Speed, Worm-hole-Routing Local Area Networks,' http://www.cs.ucla.edu/~simonw/sigcorrv/sigcom. html
- Myricom Inc., Myricom Homepage, 'http://ww\v.myri.com/myrinet/,' April 1998
- Nanette j. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, and Wen-King Su 'Myrinet --A Gigabit-per-Second Local-Area Network,' IEEE-Micro, Vol. 15, No.l, pp. 29-36, February 1995 https://doi.org/10.1109/40.342015
- Sharad Sundaresan, Riccardo Dettati, 'Distributed Adimission Control for Wormhole-Routed Networks,' Technical Report 96-015, Texas A&M University, July 1996
- Sharad Sundaresan, Riccardo Bettati, 'Distributed Connection Management for Real-Time Communication over Wormhole-Routed Networks,' Technical Report 96-021, Texas A&M University, July 1996
- Lionel M. Ni, Philip K. Mckinley, 'A Survey of Routing Techniques in Wormhole Networks,' Technical Report MSU-CPS-ACS-46, October 17, 1991
- Douglas B. West, 'Introduction of graph theory,' Prentice Hall, 1996
- Martin C. Carlisle, Errol L. Lloyd, 'On k-coloring a set of intervals,' Discrete Applied Mathematics 59, pp. 225-235, 1995
- Alan Tucker, 'Coloring a family of circular arcs,' SIAM J. APPL. MATH, Vol 29., No 3., November 1975 https://doi.org/10.1137/0129040
- Klaus Jansen, 'NP-completeness of path coloring in meshes with fixed row-column routing,' preprinted paper
- M. R. Garey, D. S. Johnson, G. L. Miller, and C. II. Papadimitriou, 'The complexity of coloring circular arcs and chords,' SIAM J. Algebraic Discrete Methods, 1(2), pp. 216-227, 1980