| Article ID: | iaor19921403 |
| Country: | Netherlands |
| Volume: | 34 |
| Start Page Number: | 27 |
| End Page Number: | 35 |
| Publication Date: | Nov 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Akl S., Labont G., Leeder M., Qiu K. |
The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports on such a parallel formulation.