摘要

This paper describes an efficient approach to representation and analysis of complex networks. Typically, an n node system is represented by an n x n connection matrix. This paper presents a new connection matrix representation scheme that uses three fields; "begin node", "end node", and "component id" to represent each node in the network. The proposed approach to connection matrix representation is more concise than the n x n matrix, which is often sparsely populated. This paper also describes network simplification algorithm based on the revised connection matrix. The algorithm when applied to a large system with 55 tie-sets reduced the network to a single tie-set.

  • 出版日期2011-10