Maximum crossing number algorithm on linear array with a reconfigurable pipelined bus system
Reference9 articles.
1. K. Arvind, V. Kamakoti and C. Rangan, Efficient Parallel Algorithms for Permutation Graphs, Journal of Parallel and Distributed Computing 26, 1995, pp. 116--124.
2. M. Atallah and S. Hambrush, "Optical Rotation Problems in Channel Routing," IEEE Transactions on Computers, Vol. C-35, pp. 843--847, September 1986.
3. C. Y. Chen and C. Hou, "A Pin Permutation Algorithm for Improving Over-the-Cell Channel Routing," IEEE Trans. CAD, Vol 14, No 8, pp 1030--1037, August 1995.
4. S. Even, A. Pnnueli and A. Leupel, "Permutation graphs and transitive graphs," Journal of the Association for Computing Machinery, Vol. 19, 1972, pp. 400--410.
5. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.