On the solvability of single rate 2-pair networks - A cut-based characterization | |
Cai, Kai ; Letaief, K.B. ; Fan, Pingyi ; Feng, Rongquan | |
2013 | |
英文摘要 | In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair problem. It is shown that the solvability of a single rate 2-pair problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a single rate 2-pair problem is presented. ? 2012 Elsevier B.V.; EI; 0; 124-133; 6 |
语种 | 英语 |
出处 | EI |
出版者 | physical communication |
内容类型 | 其他 |
源URL | [http://hdl.handle.net/20.500.11897/262848] ![]() |
专题 | 数学科学学院 |
推荐引用方式 GB/T 7714 | Cai, Kai,Letaief, K.B.,Fan, Pingyi,et al. On the solvability of single rate 2-pair networks - A cut-based characterization. 2013-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论