Abstract
One of the important problems in system structure's analysis is how to modify strongly connected structures to partial order structures that have no cycles. The partial order structuring can be realized by either of edges cut or vertices partition. This parper deals with the latter partial order structuring problem. The problem is formulated into a 0-1 linear programming problem with l variables and m constraints, where l and m are the number of vertices and cycles, respectively, in the strongly connected structure. To solve the 0-1 linear programming problem, we develop a solution algorithm based on the concept of relaxation strategy. This algorithm has an excellent ability on calculation efficiency. Consequently, this algorithm can be easily applied to the partial order structuring problem of the large-scale strongly connected structure which has a large number of vertices and cycles. The effectiveness of the algorithm is demonstraited by applying this to a routing problem of building block tyep LSI.
