Name
Abstract | ||
|---|---|---|
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Theory 44(2):599–611, 1998). These codes have been studied in several types of graphs such as hypercubes, trees, the square grid, the triangular grid, cycles and paths. In this paper, we determine the optimal cardinalities of identifying codes in cycles and paths in the remaining open cases. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00373-011-1058-6 | Graphs and Combinatorics |
Keywords | Field | DocType |
ieee trans inf theory,triangular grid,remaining open case,identifying code · optimal code · cycle · path,karpovsky et,square grid,optimal identifying codes,optimal cardinalities | Graph,Discrete mathematics,Combinatorics,Square tiling,Block code,Cardinality,Triangular grid,Linear code,Hypercube,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 4 | 1435-5914 |
Citations | PageRank | References |
9 | 0.55 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ville Junnila | 1 | 43 | 10.51 |
| Tero Laihonen | 2 | 363 | 39.39 |