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.>
No takes yet. Share an insight, caveat, or question.
Soung Chang Liew (1989) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: