Finding large degree-anonymous subgraphs is hard (Q5964077): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2260327309 / rank | |||
Normal rank | |||
Revision as of 03:32, 20 March 2024
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
