New graph invariant for graph isomorphism: Probability propagation matrix

Gow Hsing King, Wen-Guey Tzeng

Research output: Contribution to journalArticle

2 Scopus citations

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.

Original languageEnglish
Pages (from-to)337-352
Number of pages16
JournalJournal of Information Science and Engineering
Volume15
Issue number3
StatePublished - 1 May 1999

Fingerprint Dive into the research topics of 'New graph invariant for graph isomorphism: Probability propagation matrix'. Together they form a unique fingerprint.

Cite this