Finding a k-tree core and a k-tree center of a tree network in parallel

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 2, 1998, Pages 186-191

  Wang, Biing Feng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Centers; Cores; The Euler tour technique; Tree contraction; Trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; TREES (MATHEMATICS);

EULER TOUR TECHNIQUE;

PARALLEL PROCESSING SYSTEMS;

EID: 0032000663     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.663884     Document Type: Article

References (12)

1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka, "A Simple Parallel Tree Contraction Algorithm," J. Algorithms, vol. 10, pp. 287-302, 1989.
2. R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, no. 4, pp. 770-785, 1988.
3. R. Cole, "An Optimally Efficient Selection Algorithm," Information Processing Letters, vol. 26, no. 6, pp. 295-299, 1988.
4. R. Cole and U. Vishkin, "Approximate Parallel Scheduling, Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Computing, vol. 17, no. 1, pp. 128-142, 1988.
5. G.Y. Handler and P. Mirchandani, Location on Networks. Cambridge, Mass.: MIT Press, 1979.
6. J. Jaja, An Introduction to Parallel Algorithms. Addison Wesley, 1992.
7. G.L. Miller and J. Reif, "Parallel Tree Contraction and Its Applications," Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pp. 478-489, 1985.
8. S. Peng and W.-T. Lo, "A Simple Optimal Parallel Algorithm for a Core of a Tree," J. Parallel and Distributed Computing, vol. 20, pp. 388-392, 1994.
9. S. Peng and W.-T. Lo, "The Optimal Location of a Structured Facility in a Tree Network," Parallel Algorithms and Applications, vol. 2, pp. 43-60, 1994.
10. S. Peng, A.B. Stephens, and Y. Yesha, "Algorithms for a Core and k-Tree Core of a Tree," J. Algorithms, vol. 15, pp. 143-159, 1993.
11. B.C. Tansel, R.L. Francis, and T.J. Lowe, "Location on Networks: A Survey," Management Science, vol. 29, pp. 482-511, 1983.
12. R.E. Tarjan and U. Vishkin, "Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time," SIAM J. Computing, vol. 14, no. 4, pp. 81-874, 1985.