Permutation group algorithms based on partitions, I: Theory and algorithms

Journal of Symbolic Computation

Volumn 12, Issue 4-5, 1991, Pages 533-583

  Leon, Jeffrey S ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84873449241     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(08)80103-4     Document Type: Article

References (17)

1. Computing in permutation and matrix groups, II: Backtrack algorithm
2. Computing normalizers in permutation groups
3. A general backtrack algorithm for the isomorphism of combinatorial objects
4. An introduction to the group theory language Cayley
5. A computational toolkit for finite permutation groups
6. Group-theoretic algorithms and graph isomorphism
7. On an algorithm for finding a base and a strong generating set for a group given by generating permutations
8. Finding the order of a permutation group
9. Computing automorphism groups of error-correcting codes
10. A probabilistic algorithm for computing minimum weights of large error-correcting codes
11. Computing automorphisms and canonical labellings of graphs
12. Practical graph isomorphism
13. Determining the conjugacy classes of a permutation group
14. Computation with permutation groups
15. Some group-theoretic algorithms