The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080)
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 Finding a Large Subgraph under Anonymity Constraints |
scientific article; zbMATH DE number 6245126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Finding a Large Subgraph under Anonymity Constraints |
scientific article; zbMATH DE number 6245126 |
Statements
The Complexity of Finding a Large Subgraph under Anonymity Constraints (English)
0 references
14 January 2014
0 references
0.93163455
0 references
0 references
0.91280425
0 references
0.91280425
0 references
0.9083633
0 references
0.9083633
0 references
0.88256544
0 references
0.88256544
0 references
