Recognizing tough graphs is NP-hard (Q918697): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90001-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981583245 / rank | |||
Normal rank | |||
Revision as of 08:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing tough graphs is NP-hard |
scientific article |
Statements
Recognizing tough graphs is NP-hard (English)
0 references
1990
0 references
tough graphs
0 references
