An exact algorithm for the maximum probabilistic clique problem (Q405671): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 21:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the maximum probabilistic clique problem |
scientific article |
Statements
An exact algorithm for the maximum probabilistic clique problem (English)
0 references
5 September 2014
0 references
maximum clique problem
0 references
probabilistic programming
0 references
probabilistic clique
0 references
branch-and-bound
0 references
