標題: A new graph invariant for graph isomorphism: Probability propagation matrix
作者: King, GH
Tzeng, WG
資訊工程學系
Department of Computer Science
關鍵字: graph isomorphism;graph invariant;probability propagation matrix;parallel computing;computational complexity
公開日期: 1-五月-1999
摘要: 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 OF INFORMATION SCIENCE AND ENGINEERING
Volume: 15
Issue: 3
起始頁: 337
結束頁: 352
顯示於類別:期刊論文