| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653089 | Electronic Notes in Discrete Mathematics | 2006 | 7 Pages |
Abstract
We study some combinatorial and algorithmic properties of discriminating codes in bipartite graphs. In particular, we provide bounds on minimum discriminating codes and give constructions. We also show that upperbounding the size of a discriminating code is NP-complete.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
