A compact representation for permutation groups
Author:
- Mark JerrumMJMark Jerrum
- 1 March 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (1) , 60-78
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Generating coset representatives for permutation groupsJournal of Algorithms, 1981
- Lexicographic permutations with restrictionsDiscrete Applied Mathematics, 1979
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972