A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract)

[1]  Hong Shen,et al.  Fast parallel algorithm for finding the kth longest path in a tree , 1997, Proceedings. Advances in Parallel and Distributed Computing.

[2]  Nimrod Megiddo,et al.  An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[3]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[4]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

[7]  Hong Shen,et al.  Optimal Parallel Selection in Sorted Matrices , 1996, Inf. Process. Lett..