Switching to hedgehog-free graphs is NP-complete (Q3010425)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5916985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Switching to hedgehog-free graphs is NP-complete |
scientific article; zbMATH DE number 5916985 |
Statements
Switching to Hedgehog-Free Graphs Is NP-Complete (English)
0 references
1 July 2011
0 references
Seidel's switching
0 references
\(H\)-free graph
0 references
NP-completeness
0 references
0.8745516538619995
0 references
0.8410667777061462
0 references
0.8063568472862244
0 references
0.7632335424423218
0 references
