The graph isomorphism problem is to determine whether two given graphs are isomorphic or not. In this paper, we present a new graph invariant, called the probability propagation matrix. By means of this graph invariant, we present a heuristic algorithm for the problem. The algorithm is easy to implement and highly parallelizable.
|Number of pages||16|
|Journal||Journal of Information Science and Engineering|
|State||Published - 1 May 1999|