An Algorithm for Testing Isomorphism of Planer Graph Based on Distant Matrix

摘要

The testing for graph isomorphism is one of the many problems in the subject of graph theory. This thesis proposes an algorithm for testing isomorphism of planer graph of polynomial time via structuring characteristics of planer graph based on distance matrix. The algorithm, with a time complexity of O (n∧4) and a space complexity of O (n∧2), has a great application value.