TY - UNPB
T1 - On the Solvability of 2-pair Unicast Networks---A Cut-based Characterization
AU - Cai, Kai
AU - Fan, Pingyi
AU - Feng, Rongquan
AU - Ben Letaief, Khaled
PY - 2010
Y1 - 2010
N2 - In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair unicast problem. It is shown that the solvability of a 2-pair unicast 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 2-pair unicast problem is presented.
AB - In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair unicast problem. It is shown that the solvability of a 2-pair unicast 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 2-pair unicast problem is presented.
UR - https://openalex.org/W1632507601
M3 - Preprint
T3 - arXiv
BT - On the Solvability of 2-pair Unicast Networks---A Cut-based Characterization
ER -