Expansion of product replacement graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Memory-based and disk-based algorithms for very high degree permutation groups
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Strong bias of group generators: an obstacle to the "product replacement algorithm"
Journal of Algorithms - Special issue: SODA 2000
Biased tadpoles: a fast algorithm for centralizers in large matrix groups
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The Product Replacement Prospector
Journal of Symbolic Computation
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...