A Novel Algorithm Based on the Degree Tree for Graph Isomorphism

Abstract:

Article Preview

The graph isomorphism problem is to study the relationship between two graphs which seem to be different, but essentially identically. A novel algorithm based on the degree tree is proposed, where each node of the tree describes a given vertex and its neighboring information of a graph. Two vertexes in different graphs are regarded as mapping if the corresponding nodes and all their junior nodes are similar. Hence by comparing their degree trees, two graphs can be determined whether matching or not, and the mapping vertexes can be found. Experimental results show the approach’s performance.

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

417-421

DOI:

10.4028/www.scientific.net/AMR.225-226.417

Citation:

L. Hao "A Novel Algorithm Based on the Degree Tree for Graph Isomorphism", Advanced Materials Research, Vols. 225-226, pp. 417-421, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.