Abstract
Based on graph theory and the concept of degree of vertex, a new reachable vector method for network decomposition is proposed in this paper. It differs from the traditional tearing algorithms which first find maximal cyclical nets and elementary cycles, and then tear elementary cycles to get a set of cut streams that break all cycles in the flow of information. In the proposed method the initial precedence sequence of vertex is formulated by introducing the conception of the degree of vertex, which serves as a reasonable primary structure for further adjustment. Then a reachable vector is presented instead of the reachable matrix to adjudge the position of vertices. With this new method a set of torn streams and calculation sequence of the process considered are obtained directly, and it is simple and easy to understand and program.
Ten test problems are examined, and the new tearing algorithm finds the minimum number of tears for all ten problems. It indicates the effectiveness of the proposed method in the process decomposition.
