| Article ID: | iaor19891059 |
| Country: | India |
| Volume: | 5 |
| Issue: | 3 |
| Start Page Number: | 161 |
| End Page Number: | 171 |
| Publication Date: | Dec 1989 |
| Journal: | International Journal of Management and Systems |
| Authors: | Das C., Patel D.K., Rath S.K. |
| Keywords: | computational analysis |
New efficient cluster identification algorithms are presented for binary matrices. The computational time complexity is of 0 (2mm). The algorithms allow checking for the existence of clusters and determine the number of mutually separable clusters for group technology problem. A modified cluster identification algorithm for sparse matrices is also present. The algorithms are illustrated with the help of numerical examples.