An upper bound on the independence number of a graph computable in polynomial-time (Q1919180)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on the independence number of a graph computable in polynomial-time |
scientific article; zbMATH DE number 912525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the independence number of a graph computable in polynomial-time |
scientific article; zbMATH DE number 912525 |
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
0 references
0.9156737
0 references
0.9151972
0 references
0.91143584
0 references
0.9088448
0 references
0 references
0.9068086
0 references
