The following pages link to DSATUR (Q15538):
Displayed 7 items.
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- (Q3501146) (← links)
- (Q4550777) (← links)
- (Q4827156) (← links)
- (Q5489013) (← links)