## Rainbow connection number in triangular pyramids

- Hsing Wen Wang, Guo – Shi Sung
- 2012

@article{Stout1985PyramidCS, title={Pyramid Computer Solutions of the Closest Pair Problem}, author={Quentin F. Stout}, journal={J. Algorithms}, year={1985}, volume={6}, pages={200-212} }

- Published 1985 in J. Algorithms
DOI:10.1016/0196-6774(85)90038-0

Given an N x N array of OS and Is, the closest pair problem is to determine the minimum distance between any pair of ones. Let D be this minimum distance (or D = 2N if there are fewer than two Is). Two solutions to this problem are given, one requiring O(log( N) + D) time and the other O(log( N)). These solutions are for two types of parallel computers arranged in a pyramid fashion with the base of the pyramid containing the matrix. The results improve upon an algorithm of Dyer that requires o… CONTINUE READING

7 Citations

18 References

Similar Papers