An exact algorithm for the maximum probabilistic clique problem (Q405671): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6340718 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum clique problem | |||
| Property / zbMATH Keywords: maximum clique problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
probabilistic programming | |||
| Property / zbMATH Keywords: probabilistic programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
probabilistic clique | |||
| Property / zbMATH Keywords: probabilistic clique / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch-and-bound | |||
| Property / zbMATH Keywords: branch-and-bound / rank | |||
Normal rank | |||
Revision as of 17:24, 29 June 2023
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
