Cited in
(11)- An adaptive multistart tabu search approach to solve the maximum clique problem
- An effective heuristic algorithm for sum coloring of graphs
- Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\)
- Man power optimization in large-scale corporations
- QUALEX
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- Improving the extraction and expansion method for large graph coloring
- An exact algorithm with learning for the graph coloring problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Team selection for prediction tasks
- A review on algorithms for maximum clique problems
This page was built for software: EXTRACOL
