Pages that link to "Item:Q1761974"
From MaRDI portal
The following pages link to Coloring large graphs based on independent set extraction (Q1761974):
Displaying 13 items.
- EXTRACOL (Q18645) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Chromatic Schultz and Gutman polynomials of Jahangir graphs \(J_{2, m}\) and \(J_{3, m}\) (Q2684426) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
- (Q5152650) (← links)
- Team selection for prediction tasks (Q5963648) (← links)
