![]() | Up a level |
Mustafa, Mamat and Suyudi, . and Sukono, . and Bon, A.T. (2019) Find the maximum clique by graph coloring using heuristic greedy. In: 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019, 26-28 November 2019, Saudi Arabia.