Title: A new graph invariant for graph isomorphism: Probability propagation matrix
Authors: King, GH
Tzeng, WG
資訊工程學系
Department of Computer Science
Keywords: graph isomorphism;graph invariant;probability propagation matrix;parallel computing;computational complexity
Issue Date: 1-May-1999
Abstract: 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.
URI: http://hdl.handle.net/11536/31382
ISSN: 1016-2364
Journal: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
Volume: 15
Issue: 3
Begin Page: 337
End Page: 352
Appears in Collections:Articles