Abstract
Several systolic algorithms for the (reflexive) transitive closure and shortest-path problems are investigated. A new systolic algorithm and a corresponding spiral systolic architecture are proposed. The new approach offers computation saving three times that of the approach proposed by L. Guibas et al. (1979). The new spiral systolic architecture is found to be suitable for a broad class of applications.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 622-626 |
| Number of pages | 5 |
| ISBN (Print) | 0818606428 |
| State | Published - 1985 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Engineering