Jose M. Marquez, “A Hybrid Router for Multiplexer-Based CPLDs”, Jul. 1, 1999, available from Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124. |
Egon Balas et al.:“A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem”, 1991, National Science Foundation Grant, pp. 986-1004. |
Pierre Kelson, “Fast Parallel Matching in Expander Graphs”, Department of Computer Science University of British Columbia 6356 Agricultural Road, Vancouver, B.C., Canada, 1993, pp. 293-299. |
Constantine N.K. Osiakwan et al: “A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs”, Department of Computing and Information Science Queen's University, Kingston, Ontario, Canada, 1990, pp. 293-301. |
“The Programmable Logic Data Book 2000”, Virtex 2.5 Field Programmable Gate Arrays, Mar. 9, 2000—Preliminary Product Specification. Available from Xilinx Inc., 2100 Logic Drive, San Jose, CA 95124, pp. 4-5. |
Scott D. Brown et al.: “Field-Programmable Gate Arrays”, Kluwer Academic Publishers, 1993, pp. 133-145. |
Gary Chartrand et al.: “Applied and Algorithmic Graph Theory”, McGraw-Hill, Inc., 1993, pp. 2-3, 5-6, 25-26, 162-167. |
Thomas H. Cormen et al.: “Introduction to Algorithms”, the MIT Press, Cambridge MA, 1991, Chapter 27, pp. 600-602. |