Pages that link to "Item:Q1070239"
From MaRDI portal
The following pages link to Numerical experiences with graph coloring algorithms (Q1070239):
Displaying 7 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Colouring the discretization graphs arising in the multigrid method (Q805184) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Using an incomplete version of dynamic backtracking for graph colouring (Q2741266) (← links)
- Smallest-last ordering and clustering and graph coloring algorithms (Q3765255) (← links)