电子工程系学术讲座（三、四、五、六）

Toward developing our lower bound and the efficient algorithm for computing this bound, we have introduced/discussed various graph-theoretic concepts. Although in this paper these concepts are applied solely in the context of secure network coding, they appear to be of fundamental interest in graph theory and we expect that they will find applications in graph theory and beyond.

2017年7月28日

[打印文章] [添加收藏]