• # CAS

• Referenced in 21 articles [sw07634]
• Galois conjugate; using an outer automorphism; powering, tensoring, inducing, extending; extracting irreducible components (using several...
• # Gpd

• Referenced in 8 articles [sw08651]
• recent work includes the implementation of automorphisms of a finite, connected groupoid: by permutation ... objects; by automorphism of the root group; and by choice of rays to each object ... automorphism group of such a groupoid is also computed, together with an isomorphism...
• # AutPGrp

• Referenced in 2 articles [sw08640]
• package AutPGrp: Computing the Automorphism Group of a p-Group. The AutPGrp package introduces ... function to compute the automorphism group of a finite $p$-group. The underlying algorithm...
• # nishe

• Referenced in 1 article [sw19166]
• algorithm used by nauty. We employ discovered automorphisms to ensure that a canonical labeling ... polynomial time for colored Miyazaki graphs. These automorphisms can be used to make better choices ... depending on partial knowledge of the full automorphism group. The proposed modifications are not specific ... Miyazaki graphs. Any graph with a nontrivial automorphism group can benefit from our approach...
• # ModIsom

• Referenced in 1 article [sw08645]
• package ModIsom: Computing automorphisms and checking isomorphisms for modular group algebras of finite p-groups ... contains a method to determine the automorphism group and to test isomorphis of such algebras...
• # bliss

• Referenced in 1 article [sw21797]
• bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs. bliss ... open source tool for computing automorphism groups and canonical forms of graphs. It has both...