A branch and bound algorithm for the maximum clique problem (Q5905591): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56210435, #quickstatements; #temporary_batch_1714639695901 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Gregory P. Rodgers / rank | |||
Property / author | |||
Property / author: Gregory P. Rodgers / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56210435 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 11:01, 2 May 2024
scientific article; zbMATH DE number 95834
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch and bound algorithm for the maximum clique problem |
scientific article; zbMATH DE number 95834 |
Statements
A branch and bound algorithm for the maximum clique problem (English)
0 references
16 January 1993
0 references
maximum clique
0 references
unconstrained quadratic zero-one programming
0 references
branch-and- bound
0 references