Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641)
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: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity |
scientific article; zbMATH DE number 5509393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity |
scientific article; zbMATH DE number 5509393 |
Statements
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (English)
0 references
19 February 2009
0 references
bipartite graphs
0 references
discriminating codes
0 references
identifying codes
0 references
locating-dominating codes
0 references
separating codes
0 references
complexity
0 references
0.9520222
0 references
0.9342065
0 references
0.91345304
0 references
0.90245533
0 references
0.8974117
0 references
0.89486027
0 references
0.89022636
0 references
0.8893251
0 references
0.88853186
0 references
