Pages that link to "Item:Q976050"
From MaRDI portal
The following pages link to An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050):
Displaying 8 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
