关键词: 图的同构 置换群 回溯算法 多重集排列 随机算法

Abstract:

This paper focuses on proposing and analysing a practical improved isomorphism determination algorithm tot graphs based on an isomorphic graph determi  nation algorithm which cannot find theoretically any polynomial time. In addition the paper also presents a more efficient randomized version of the alg orithm.

Key words: isomorphic graph, permutation group, backtracking algorithm, permutation of multiple-sets, random algorit hm