Author:
Kumlander Deniss,Kulitškov Aleksei
Publisher
Springer International Publishing
Reference14 articles.
1. Kubale, M.: Graph Colorings. American Mathematical Society, US (2004)
2. Kumlander, D.: Some practical algorithms to solve the maximum clique problem. Tallinn University of Technology, Tallinn (2005)
3. Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85–86 (1967)
4. Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures–SPAA’14, pp. 166–177 (2014)
5. Brelaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251–256 (1979)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献