EXTRACOL
From MaRDI portal
Software:18645
No author found.
Related Items (10)
A review on algorithms for maximum clique problems ⋮ An exact algorithm with learning for the graph coloring problem ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\) ⋮ Maximum-weight stable sets and safe lower bounds for graph coloring ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ An effective heuristic algorithm for sum coloring of graphs ⋮ Improving the extraction and expansion method for large graph coloring ⋮ Team selection for prediction tasks ⋮ Unnamed Item
This page was built for software: EXTRACOL
