The Guessing Number of Undirected Graphs
暂无分享,去创建一个
[1] Søren Riis. Graph Entropy, Network Coding and Guessing games , 2007, ArXiv.
[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[3] E. Chong,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[4] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..
[5] Peter J. Cameron,et al. On the guessing number of shift graphs , 2009, J. Discrete Algorithms.
[6] C. Berge. Fractional Graph Theory , 1978 .
[7] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[8] R. Lathe. Phd by thesis , 1988, Nature.
[9] P. Steerenberg,et al. Targeting pathophysiological rhythms: prednisone chronotherapy shows sustained efficacy in rheumatoid arthritis. , 2010, Annals of the rheumatic diseases.
[10] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[11] Igor L. Markov,et al. Breaking instance-independent symmetries in exact graph coloring , 2004 .
[12] J. Pach,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[13] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .
[14] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[15] Maximilien Gadouleau,et al. Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications , 2011, IEEE Transactions on Information Theory.
[16] L. Lovász. A Characterization of Perfect Graphs , 1972 .
[17] Søren Riis,et al. Information flows, graphs and their guessing numbers , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.