Pages that link to "Item:Q1401918"
From MaRDI portal
The following pages link to The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918):
Displayed 11 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Track assignment (Q2457297) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)