The complexity of recognizing minimally tough graphs (Q2656956)
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: The complexity of recognizing minimally tough graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of recognizing minimally tough graphs |
scientific article |
Statements
The complexity of recognizing minimally tough graphs (English)
0 references
17 March 2021
0 references
weighted toughness
0 references
minimally tough
0 references
DP-complete graph
0 references
0.8930392861366272
0 references
0.8926368951797485
0 references
0.847484290599823
0 references
0.8196744918823242
0 references
