Pages that link to "Item:Q2448876"
From MaRDI portal
The following pages link to A polyhedral approach for the equitable coloring problem (Q2448876):
Displaying 14 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- Equitable coloring of some convex polytope graphs (Q1794705) (← links)
- Improving lower bounds for equitable chromatic number (Q2147053) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Polyhedral results for the equitable coloring problem (Q2840701) (← links)
- A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- (Q5377224) (← links)