Pages that link to "Item:Q2097180"
From MaRDI portal
The following pages link to Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180):
Displaying 5 items.
- Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- (Q3082074) (← links)
- (Q4471901) (← links)