图自同构搜索中的冲突预测
Conflict Anticipation in the Search for Graph Automorphisms
摘要:
图自同构的有效搜索允许识别许多离散结构中的对称性,从化学分子到微处理器电路。使用这种类型的结构可以增强可视化,并加快计算优化和验证。图自同构问题的竞争算法是基于有效的分区细化与群论修剪技术增强。在本文中,我们通过引入多个分区的同时细化来改进图自同构问题的先前算法,这使得能够预测未来的搜索冲突,并导致显着的修剪,减少整体运行时间。经验上,我们观察到宫崎图,这已被证明是阻碍领先的图形自同构算法的家庭的指数加速。
英文摘要:
Effective search for graph automorphisms allows identifying symmetries in many discrete structures, ranging from chemical molecules to microprocessor circuits. Using this type of structure can enhance visualization as well as speed up computational optimization and verification. Competitive algorithms for the graph automorphism problem are based on efficient partition refinement augmented with group-theoretic pruning techniques. In this paper, we improve prior algorithms for the graph automorphism problem by introducing simultaneous refinement of multiple partitions, which enables the anticipation of future conflicts in search and leads to significant pruning, reducing overall runtimes. Empirically, we observe an exponential speedup for the family of Miyazaki graphs, which have been shown to impede leading graph-automorphism algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。