Abstract | ||
---|---|---|
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1,= |
Year | DOI | Venue |
---|---|---|
2007 | 10.1016/j.disc.2006.07.041 | Discrete Mathematics |
Keywords | Field | DocType |
random graph,upper and lower bounds | Discrete mathematics,Combinatorics,Random graph,Vertex (geometry),Upper and lower bounds,Block code,Cardinality,Expander code,Linear code,Reed–Muller code,Mathematics | Journal |
Volume | Issue | ISSN |
307 | 9-10 | Discrete Mathematics |
Citations | PageRank | References |
25 | 1.20 | 9 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alan M. Frieze | 1 | 4837 | 787.00 |
Ryan Martin | 2 | 144 | 14.43 |
Julien Moncel | 3 | 191 | 17.33 |
M. Ruszinkó | 4 | 230 | 35.16 |
Cliff Smyth | 5 | 64 | 4.92 |