An optimal parallel algorithm for computing furthest neighbors in a tree
- 1 November 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 44 (3) , 155-160
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On some link distance problems in a simple polygonIEEE Transactions on Robotics and Automation, 1990
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic TimeSIAM Journal on Computing, 1988
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- Distributed algorithms for finding centers and medians in networksACM Transactions on Programming Languages and Systems, 1984