Synthesis of nonoriented 2n-terminal communication nets with prescribed terminal capacity matrices of two-port flows

The realization of nonoriented communication nets satisfying requirements of two commodities is investigated in this paper. A necessary condition for a requirement matrix to be a terminal capacity matrix of a communication net is found. A method of synthesizing a -terminal net with the use of a special configuration is presented. The results based on graph theory are more convenient than those of linear programming. Whenever a realization is obtained, it is an optimum realization. The procedures which convert a -terminal net into a -terminal net are also discussed.