Author:
Lewis R.,Thiruvady D.,Morgan K.
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference28 articles.
1. Aravind, N., Kalyanasundaram, S., Swami Kare, A., 2016. Linear time algorithms for happy vertex coloring problems for trees. In Mäkinen, V., Puglisi, S., Salmela, L., (Eds.). Combinatorial Algorithms: IWOCA 2016, volume 9843 of Lecture Notes in Computer Science. Springer Cham. pp. 281–292.
2. Algorithms and hardness results for happy coloring problems;Aravind;CoRR,2017
3. Network Science;Barabási,2016
4. A graph coloring heuristic using partial solutions and a reactive tabu scheme;Blöchliger;Comput. Oper. Res.,2008
5. Construct, merge, solve & adapt a new general algorithm for combinatorial optimization;Blum;Comput. Oper. Res.,2016
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献