Pages that link to "Item:Q3150263"
From MaRDI portal
The following pages link to Scheduling Problems and Mixed Graph Colorings (Q3150263):
Displayed 14 items.
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Tutte polynomials for directed graphs (Q2284730) (← links)
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem (Q2336703) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)