A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q3404446)
From MaRDI portal
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
