On Mon, Dec 09, 2002 at 12:59:11PM +0100, Bettina Eick wrote:
> Dear GAP Forum, dear Bill,
> > I would like to computing the lists of minimal normal subgroups of a
> > (small) group.
> This is not implemented in GAP, but it is very easy to implement it.
> I include a possible implementation below. Since I have written this
> very quickly, it is likely that it can still be improved.
Thanks, you GAP program work fine and is much faster that NormalSubgroups,
and save me a lot of graph processing.
The full graph of all abstract groups of order <= 50 is computed in one minute
on my 333MHz machine!