Finding large degree-anonymous subgraphs is hard (Q5964077)
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 6546622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding large degree-anonymous subgraphs is hard |
scientific article; zbMATH DE number 6546622 |
Statements
Finding large degree-anonymous subgraphs is hard (English)
0 references
26 February 2016
0 references
NP-hardness
0 references
approximation-hardness
0 references
W-hardness
0 references
graph algorithms
0 references
0.9214485883712769
0 references
0.8873195648193359
0 references
0.8848448991775513
0 references
0.8781795501708984
0 references
0.8682090044021606
0 references
