A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q3404446): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 02:35, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique |
scientific article |
Statements
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (English)
0 references
9 February 2010
0 references
