Approximation algorithm for the distance-3 independent set problem on cubic graphs (Q2980912)
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: Approximation algorithm for the distance-3 independent set problem on cubic graphs |
scientific article; zbMATH DE number 6711890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the distance-3 independent set problem on cubic graphs |
scientific article; zbMATH DE number 6711890 |
Statements
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (English)
0 references
5 May 2017
0 references
0 references
0 references
0.8985556960105896
0 references
0.8425891399383545
0 references
0.8022950291633606
0 references
0.8000327944755554
0 references
0.7917287945747375
0 references
