Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs (Q1935804)
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: Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs |
scientific article; zbMATH DE number 6137348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs |
scientific article; zbMATH DE number 6137348 |
Statements
Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs (English)
0 references
19 February 2013
0 references
exact algorithm
0 references
independent set
0 references
measure and conquer
0 references
0.9111953973770142
0 references
0.8548719882965088
0 references
0.8481554388999939
0 references
0.8437458872795105
0 references
0.8368775248527527
0 references
