On a new class of identifying codes in graphs (Q845971): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2006.11.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2006.11.007 / rank | |||
Normal rank | |||
Latest revision as of 05:02, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a new class of identifying codes in graphs |
scientific article |
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
