| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514558 | Electronic Notes in Discrete Mathematics | 2005 | 4 Pages |
Abstract
This talk deals with identifying codes in graphs. These codes we defined to model a problem of fault detection in multiprocessor systems. They are closely related to covering and superimposed codes. Very nice combinatorial questions arise from these codes, some of which we present during the talk.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Julien Moncel,