摘要
Evolutionarycomputationtechniqueshavemostlybeenusedtosolvevariousoptimizationproblems,anditiswellknownthatgraphisomorphismproblem(GIP)isanondeterministicpolynomialproblem.Asimulatedannealing(SA)algorithmfordetectinggraphisomorphismisproposed,andtheproposedSAalgorithmiswellsuitedtodealwithrandomgraphswithlargesize.ToverifythevalidityoftheproposedSAalgorithm,simulationsareperformedonthreepairsofsmallgraphsandfourpairsoflargerandomgraphswithedgedensities0.5,0.1,and0.01,respectively.ThesimulationresultsshowthattheproposedSAalgorithmcandetectgraphisomorphismwithahighprobability.
出版日期
2008年05月15日(中国期刊网平台首次上网日期,不代表论文的发表时间)