Title of article :
Discriminating codes in bipartite graphs
Author/Authors :
Charbit، نويسنده , , E. and Charon، نويسنده , , I. and Cohen، نويسنده , , G. and Hudry، نويسنده , , O.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2006
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.
Keywords :
Coverings , Bipartite graphs , Identifying codes , Complexity
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
