A new graph invariant for graph isomorphism: Probability propagation matrix

檔案

本條目沒有附加檔案。

日期

1999-05-01

期刊名稱

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料