An exact algorithm for the maximum probabilistic clique problem (Q405671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact algorithm for the maximum probabilistic clique problem |
scientific article; zbMATH DE number 6340718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the maximum probabilistic clique problem |
scientific article; zbMATH DE number 6340718 |
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
0 references
0 references
0 references
0 references
0 references
0.8139286041259766
0 references
0.8057423233985901
0 references
0.797274649143219
0 references
0.7915077209472656
0 references
0.787765383720398
0 references
