# On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization

Source: [On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization](<https://www.sota2.com/research/paper/68fa4ec51e209131ce95e58d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:58:50.956Z

Authors: K. Cai, K. B. Letaief, P. Fan, R. Feng

Published: 2010-07-03T02:12:27.000Z

## Abstract

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, $\\mathcal A\_{1,1}$, $\\mathcal A\_{2,2}$, $\\mathcal A\_{1,2}$ and $\\mathcal A\_{2,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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1007.0465>)

[PDF](<https://arxiv.org/pdf/1007.0465.pdf>)
