Author:
Yang Ying,Gu Yu,Li Chuanwen,Wan Changyi,Yu Ge
Publisher
Springer International Publishing
Reference7 articles.
1. Blum, A.: New approximation algorithms for graph coloring. J. ACM 41(3), 470–516 (1994)
2. Che, S., Rodgers, G., Beckmann, B., Reinhardt, S.: Graph coloring on the GPU and some techniques to improve load imbalance. In: Parallel and Distributed Processing Symposium Workshop, pp. 610–617 (2015)
3. Chen, X., Li, P., Yang, C.: Efficient and high-quality sparse graph coloring on the GPU. CoRR abs/1606.06025 (2016)
4. Li, Z., Zhu, E., Shao, Z., Xu, J.: Np-completeness of local colorings of graphs. Inf. Process. Lett. 130, 25–29 (2018)
5. Preuveneers, D., Berbers, Y.: ACODYGRA: an agent algorithm for coloring dynamic graphs. SYNASC 6, 381–390 (2004)