Computing independent sets in graphs with large girth (Q1183338)
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: Computing independent sets in graphs with large girth |
scientific article; zbMATH DE number 33083
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing independent sets in graphs with large girth |
scientific article; zbMATH DE number 33083 |
Statements
Computing independent sets in graphs with large girth (English)
0 references
28 June 1992
0 references
girth
0 references
independent set
0 references
NP-complete
0 references
polynomial time approximation algorithm
0 references
0.9424069
0 references
0.92784286
0 references
0.91764665
0 references
0.9159967
0 references
0.9128735
0 references
0.9112623
0 references
