Pages that link to "Item:Q3075615"
From MaRDI portal
The following pages link to A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions (Q3075615):
Displaying 6 items.
- A fast algorithm for equitable coloring (Q532129) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)
- Fast edge colorings with fixed number of colors to minimize imbalance (Q5301445) (← links)
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance (Q5385978) (← links)