Pages that link to "Item:Q1040976"
From MaRDI portal
The following pages link to A search space ``cartography'' for guiding graph coloring heuristics (Q1040976):
Displayed 9 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)