An exact algorithm for the maximum probabilistic clique problem (Q405671): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-013-9699-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120286774 / rank | |||
Normal rank | |||
Revision as of 23:53, 19 March 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
