View full textDownload full textOriginal ArticleRelated articlesView all related articles Add to shortlistLinkPermalink http://***/10.1080/00207217.2014.910895
View full textDownload full textOriginal ArticleRelated articlesView all related articles Add to shortlistLinkPermalink http://***/10.1080/00207217.2014.910895
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 [9] , which extends Jeffrey Leon&#...
详细信息
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 [9] , which extends Jeffrey Leon's Partition Backtrack framework [14] , [15] . Our methods generalise both Nauty [17] and Steve Linton's Minimal image algorithm [16] .
暂无评论