Abstract: In this paper, we consider a multi-pair two-way amplify-and-forward relaying system where multiple sources exchange information via a relay node equipped with large-scale antenna arrays.

time algorithm for constructing a Gomory-Hu tree for a graph with m edges. This shows that the all-pairs max-flows problem has the same running time as the single-pair max-flow problem, up to a ...

Digital Engineering, Aviva Plc, Norwich, Norfolk NR1 3NS, U.K. School of Computing Sciences, University East Anglia, Norwich, Norfolk NR4 7TJ, U.K.