A new graph invariant for graph isomorphism: Probability propagation matrix

Full metadata record

DC Field	Value	Language
dc.contributor.author	King, GH	en_US
dc.contributor.author	Tzeng, WG	en_US
dc.date.accessioned	2014-12-08T15:46:40Z	-
dc.date.available	2014-12-08T15:46:40Z	-
dc.date.issued	1999-05-01	en_US
dc.identifier.issn	1016-2364	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31382	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	graph isomorphism	en_US
dc.subject	graph invariant	en_US
dc.subject	probability propagation matrix	en_US
dc.subject	parallel computing	en_US
dc.subject	computational complexity	en_US
dc.title	A new graph invariant for graph isomorphism: Probability propagation matrix	en_US
dc.type	Article	en_US
dc.identifier.journal	JOURNAL OF INFORMATION SCIENCE AND ENGINEERING	en_US
dc.citation.volume	15	en_US
dc.citation.issue	3	en_US
dc.citation.spage	337	en_US
dc.citation.epage	352	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000080411200001	-
dc.citation.woscount	1	-
Appears in Collections:	Articles