Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7615636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph |
scientific article; zbMATH DE number 7615636 |
Statements
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (English)
0 references
11 November 2022
0 references
clique problem
0 references
dynamic programming
0 references
integer programming
0 references
multiple-choice constraints
0 references
series-parallel graphs
0 references
0 references
0 references
0.8977532386779785
0 references
0.7376976609230042
0 references
0.7323185205459595
0 references
0.7236897945404053
0 references
