Computing connected components on a linear array with a reconfigurable pipelined bus system.
From MaRDI portal
Recommendations
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations
- An efficient and fast parallel-connected component algorithm
- Determining connected components in linear time by a linear number of processors
- scientific article; zbMATH DE number 1057773
Cited in
(7)- A linear systolic algorithm for the connected component problem
- Solving graph theory problems using reconfigurable pipelined optical buses
- Repetitions detection on a linear array with reconfigurable pipelined bus system
- FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
- On high-speed computing with a programmable linear array
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system
This page was built for publication: Computing connected components on a linear array with a reconfigurable pipelined bus system.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534713)
