Computing canonical images in permutation groups with Graph Backtracking
arxiv(2023)
摘要
We describe a new algorithm for finding a canonical image of an object under the action of a finite permutation group. This algorithm builds on previous work using Graph Backtracking, which extends Jeffrey Leon's Partition Backtrack framework. Our methods generalise both Nauty and Steve Linton's Minimal image algorithm.
更多查看译文
关键词
Permutation groups,Search algorithms,Canonical image,Backtrack methods
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要