Pages that link to "Item:Q5938473"
From MaRDI portal
The following pages link to A GRASP for coloring sparse graphs (Q5938473):
Displaying 17 items.
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Linear coloring of sparse graphs (Q412383) (← links)
- Heuristics for the bandwidth colouring problem (Q537987) (← links)
- A grasp-knapsack hybrid for a nurse-scheduling problem (Q835758) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Heuristics for the robust coloring problem (Q5177316) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)