The following pages link to (Q4813178):
Displaying 6 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems (Q2419531) (← links)
- A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
