Comments on "Fundamental conditions governing TDM switching assignments in terrestrial and satellite networks" (by K.Y. Eng and A.S. Acampora)
Soung Chang Liew · IEEE Transactions on Communications · 1989
The problem in the above paper (see ibid., vol.COM-35, p.755-61, July 1987) is formulated in terms of a max-flow network problem. The main theorem can be proved quite simply using the max-flow-min-cut theorem once the proper way of looking at the problem is identified.>