A note on the approximability of the toughness of graphs (Q1827680)
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: A note on the approximability of the toughness of graphs |
scientific article; zbMATH DE number 2083645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the approximability of the toughness of graphs |
scientific article; zbMATH DE number 2083645 |
Statements
A note on the approximability of the toughness of graphs (English)
0 references
6 August 2004
0 references
Toughness
0 references
Graph
0 references
Approximation algorithm
0 references
Complexity
0 references
0.81037437915802
0 references
0.8071988821029663
0 references
0.7968628406524658
0 references
0.7780593633651733
0 references
0.7768658399581909
0 references
