Simulated annealing algorithm for detecting graph isomorphism

在线阅读 下载PDF 导出详情
摘要 Evolutionarycomputationtechniqueshavemostlybeenusedtosolvevariousoptimizationproblems,anditiswellknownthatgraphisomorphismproblem(GIP)isanondeterministicpolynomialproblem.Asimulatedannealing(SA)algorithmfordetectinggraphisomorphismisproposed,andtheproposedSAalgorithmiswellsuitedtodealwithrandomgraphswithlargesize.ToverifythevalidityoftheproposedSAalgorithm,simulationsareperformedonthreepairsofsmallgraphsandfourpairsoflargerandomgraphswithedgedensities0.5,0.1,and0.01,respectively.ThesimulationresultsshowthattheproposedSAalgorithmcandetectgraphisomorphismwithahighprobability.
机构地区 不详
出版日期 2008年05月15日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献