On a new class of identifying codes in graphs (Q845971)
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: On a new class of identifying codes in graphs |
scientific article; zbMATH DE number 5664785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a new class of identifying codes in graphs |
scientific article; zbMATH DE number 5664785 |
Statements
On a new class of identifying codes in graphs (English)
0 references
29 January 2010
0 references
fault tolerance
0 references
parallel processing
0 references
identification
0 references
optimal code
0 references
0.861714243888855
0 references
0.859925389289856
0 references
0.8556385040283203
0 references
0.8538246154785156
0 references
0.8489516377449036
0 references
