Pages that link to "Item:Q2327955"
From MaRDI portal
The following pages link to Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955):
Displaying 11 items.
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- (Q5005155) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Fixed interval scheduling with third‐party machines (Q6065340) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
