- https://doi.org/10.1007/3-540-62828-2_128
Parallel computing of fragment vector in Steiner triple systems
- Jan 1, 1997
- Erik Urland
Abstract
In this paper we describe a linear time algorithm using O(n2) processors for computing the fragment vector in Steiner triple systems. The algorithm is designed for SIMD machine having a grid interconnection network. We show the implementation and some experimental results obtained on the Connection Machine CM-2.
- # Steiner Triple Systems
- # Connection Machine CM-2
- # Machine CM-2
- # Connection Machine
- # N2 Processors
- # Linear Algorithm
- # SIMD Machine
- # Grid Interconnection
- # Triple Systems
- # Linear Time
