Random subgraphs make identification affordable (Q501982)
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: Random subgraphs make identification affordable |
scientific article; zbMATH DE number 6303021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random subgraphs make identification affordable |
scientific article; zbMATH DE number 6303021 |
Statements
Random subgraphs make identification affordable (English)
0 references
10 January 2017
0 references
11 June 2014
0 references
identifying codes
0 references
random subgraphs
0 references
identifying code of a graph
0 references
math.CO
0 references
cs.DM
0 references
0 references
0.8302786
0 references
0.81935525
0 references
0 references
0 references
0 references
0 references
0 references
