A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:43, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sequential elimination algorithm for computing bounds on the clique number of a graph |
scientific article |
Statements
A sequential elimination algorithm for computing bounds on the clique number of a graph (English)
0 references
15 August 2008
0 references
maximum clique
0 references
clique number
0 references
upper bounds
0 references
lower bounds
0 references
sequential elimination algorithm
0 references
