Abstract
Matrix multiplication algorithms for cube connected and perfect shuffle computers are presented. It is shown that many graph problems can be solved efficiently using the matrix multiplication algorithms.
| Original language | English (US) |
|---|---|
| Pages | 27-36 |
| Number of pages | 10 |
| State | Published - 1979 |
| Externally published | Yes |
| Event | Proc Annu Allerton Conf Commun Control Comput 17th - Monticello, IL, USA Duration: Oct 10 1979 → Oct 12 1979 |
Conference
| Conference | Proc Annu Allerton Conf Commun Control Comput 17th |
|---|---|
| City | Monticello, IL, USA |
| Period | 10/10/79 → 10/12/79 |
All Science Journal Classification (ASJC) codes
- General Engineering