A note on the approximability of the toughness of graphs (Q1827680): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.10.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038001771 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recognizing tough graphs is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:24, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the approximability of the toughness of graphs |
scientific article |
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
