The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:35, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The clique problem with multiple-choice constraints under a cycle-free dependency graph |
scientific article |
Statements
The clique problem with multiple-choice constraints under a cycle-free dependency graph (English)
0 references
29 June 2020
0 references
clique problem
0 references
multiple-choice constraints
0 references
perfect graph
0 references
convex-hull description
0 references
scheduling
0 references
