Analysis of the GNP network structure by ISM

Abstract

In the design of computer software system with various functions, the control of implementation is not easy. When we consider the control flow as a transition chart, we should make a graph only from the elements and their relations, In this paper, the best structure of graph is acquired by GNP. First, we assume an appropriate fitness function for a given problem. However, even the necessary element will be disappeared in the end of evolutionary process. This paper explains that the sparse structure among their relations are extracted by ISM. Then, the necessary node will be embedded in the evolutionary process.