论文信息 - On the Computational Complexity of the Linear Solvability of Information Flow Problems with Hierarchy Constraint - 字舞流文

On the Computational Complexity of the Linear Solvability of Information Flow Problems with Hierarchy Constraint

Minoru Ito | Yuki Takeda | Yuichi Kaji

[1] April Rasala Lehman,et al. Complexity classification of network information flow problems , 2004, SODA '04.

[2] Peter Sanders,et al. Polynomial time algorithms for network information flow , 2003, SPAA '03.

[3] Randall Dougherty,et al. Achievable rate regions for network coding , 2012, ITA.

[4] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.

[5] Shuo-Yen Robert Li,et al. Linear network coding , 2003, IEEE Trans. Inf. Theory.