In this paper efficient algorithms are presented for identifying the generators of regular graph model G formed by Cartesian or Strong Cartesian graph products. This process of identification is called the factorization of G and the generators are also known as factors of G. Most of the structural models are regular and can be considered as the product of some simple graphs such as paths and/or cycles. By finding the factors of a given graph G, certain problems in structural mechanics can be solved more efficiently such as partitioning.
展开▼
