Pages that link to "Item:Q1761974"
From MaRDI portal
The following pages link to Coloring large graphs based on independent set extraction (Q1761974):
Displaying 5 items.
- 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)
- Team selection for prediction tasks (Q5963648) (← links)
