Finding large degree-anonymous subgraphs is hard (Q5964077)
From MaRDI portal
scientific article; zbMATH DE number 6546622
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
