On the guessing number of shift graphs

Journal of Discrete Algorithms

Volumn 7, Issue 2, 2009, Pages 220-226

  Wu, Taoyang ^a   Cameron, Peter ^a   Riis, Søren ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Guessing number; Network coding; Shift graph

Indexed keywords

CIRCUIT COMPLEXITY; CIRCULANT GRAPHS; GUESSING NUMBER; LOWER AND UPPER BOUNDS; NETWORK CODING; NEW CONCEPTS; SHIFT GRAPH;

EID: 64149097079     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.09.009     Document Type: Article

References (12)

1. Bermond J.-C., Comellas F., and Hsu D.F. Distributed loop computer networks: A survey. Journal of Parallel and Distributed Computing 24 (1995) 2-10
2. Hushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
3. Bang-Jensen J., and Gutin G. Digraphs. Theory, Algorithms and Applications (2000), Springer
4. Riis S. Information flows, graphs and their guessing numbers. Electronic Journal of Combinatorics R44 (2006) 1-17
5. Riis S. Reversible and Irreversible information networks. IEEE Transactions on Information Theory 53 11 (2007) 4339-4349
6. Riis S. Graph entropy, network coding and guessing games. Technical report (2007). arxiv.org/pdf/0711.4175v1
7. S. Riis, Utilising public information in network coding, in: General Theory of Information Transfer and Combinatorics, 2006, pp. 861-897
8. Valiant L. Why is boolean circuit complexity theory difficult?. In: Paterson M.S. (Ed). Boolean Function Complexity (1992), Cambridge University Press 84-94
9. Valiant L. Graph-theoretic arguments in low-level complexity. Proceedings of 6th MFCS. Lecture Notes in Computer Science vol. 53 (1977), Springer 162-176
10. Wu T. Regular configurations and disjoint cycles in shift graphs. Technical report. arXiv: 0710.0125
11. T. Wu, Cycle packing in shift graphs, 2008, in preparation
12. B. Zhang, Critical analysis on different graphs of information networks in terms of guessing game, Master Thesis, Queen Mary, University of London, 2005