| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431106 | Journal of Discrete Algorithms | 2009 | 7 Pages |
Abstract
In this paper we investigate guessing number, a relatively new concept linked to network coding and certain long standing open questions in circuit complexity. Here we study the bounds and a variety of properties concerning this parameter. As an application, we obtain the lower and upper bounds for shift graphs, a subclass of directed circulant graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Taoyang Wu, Peter Cameron, Søren Riis,