An upper bound on the independence number of a graph computable in polynomial-time (Q1919180)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the independence number of a graph computable in polynomial-time |
scientific article |
Statements
An upper bound on the independence number of a graph computable in polynomial-time (English)
0 references
11 February 1997
0 references
maximum independent set
0 references
upper bound
0 references
independence number of an undirected graph
0 references
Lagrangian duality
0 references
