EXTRACOL

swMATH6552MaRDI QIDQ18645FDOQ18645

Author name not available (Why is that?)

Described by source

• Coloring large graphs based on independent set extraction

Cited In (10)

• Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
• Improving the extraction and expansion method for large graph coloring
• An adaptive multistart tabu search approach to solve the maximum clique problem
• An exact algorithm with learning for the graph coloring problem
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Title not available (Why is that?)
• Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\)
• An effective heuristic algorithm for sum coloring of graphs
• A review on algorithms for maximum clique problems
• Team selection for prediction tasks

This page was built for software: EXTRACOL