Author:
Bairamkulov Rassul,Friedman Eby
Publisher
Springer International Publishing
Reference130 articles.
1. M. R. Garey and D. S. Johnson, “The Complexity of Near-Optimal Graph Coloring,” Journal of the ACM, Vol. 23, No. 1, pp. 43–49, January 1976.
2. P. E. Ceruzzi, “The Early Computers of Konrad Zuse, 1935 to 1945,” Annals of the History of Computing, Vol. 3, No. 3, pp. 241–262, September 1981.
3. C. F. O’Donnell, “Engineering for Systems using Large Scale Integration,” Proceedings of the Fall Joint Computer Conference, Vol. 1, pp. 867–876, December 1968.
4. B. W. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” The Bell System Technical Journal, Vol. 49, No. 2, pp. 291–307, February 1970.
5. C. Y. Lee, “An Algorithm for Path Connections and its Applications,” IRE Transactions on Electronic Computers, Vol. EC-10, No. 3, pp. 346–365, September 1961.