Name
Abstract | ||
|---|---|---|
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems ... |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/S0895480103435469 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
optimal splitting authentication codes,n vertex,combinatorial constructions | Row,Discrete mathematics,Combinatorics,Authentication,Graph design,Block design,Optimal design,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 4 | 0895-4801 |
Citations | PageRank | References |
14 | 0.83 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gennian Ge | 1 | 904 | 95.51 |
| Ying Miao | 2 | 491 | 43.85 |
| Lihua Wang | 3 | 14 | 0.83 |