On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs (Q2412436)
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 6796754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs |
scientific article; zbMATH DE number 6796754 |
Statements
On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs (English)
0 references
23 October 2017
0 references
0.8756276369094849
0 references
0.7938231825828552
0 references
0.7330431342124939
0 references
0.7192884087562561
0 references
0.7108177542686462
0 references
