Author:
Maitra Timir,Pal Anindya J.,Choi Minkyu,Kim Taihoon
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Garey, M.R., Johnson, D.S.: Computers And Intractability: A Guide To The Theory Of Np-Completeness. W. H. Freeman and Co., New York (1979)
2. Baase, S., Gelder, A.V.: Computer Algorithms: Introduction To Design And Analysis. Addison-Wesley, Reading (1999)
3. Wood, D.C.: A technique for coloring a graph applicable to large scale time-tabling problems. Computer Journal 12, 317–319 (1969)
4. Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84(6), 489–505 (1979)
5. Chow, F.C., Hennessy, J.L.: Register allocation by priority based coloring. In: Proceedings of the ACM SIGPLAN 1984 Symposium on Compiler Construction, New york, pp. 222–232 (1984)