Pages that link to "Item:Q1686064"
From MaRDI portal
The following pages link to Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064):
Displayed 6 items.
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments (Q5162169) (← links)
