Simple and fast: Improving a branch-and-bound algorithm for maximum clique (Q4411385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1947416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple and fast: Improving a branch-and-bound algorithm for maximum clique |
scientific article; zbMATH DE number 1947416 |
Statements
8 July 2003
0 references
maximum clique
0 references
branch-and-bound
0 references
constraint programming
0 references
cost based filtering
0 references
0.8564581274986267
0 references
0.8548526763916016
0 references
0.8461675643920898
0 references
0.8393326997756958
0 references
Simple and fast: Improving a branch-and-bound algorithm for maximum clique (English)
0 references