An optimal parallel algorithm for computing furthest neighbors in a tree

DOI10.1016/0020-0190(92)90056-2zbMath0759.68026OpenAlexW2050934505MaRDI QIDQ1205722

Anil Maheshwari, Subir Kumar Ghosh

Publication date: 1 April 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90056-2

zbMATH Keywords

EREW PRAMdiameter of a treefurthest neighbor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

A linear-time algorithm for solving the center problem on weighted cactus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed algorithms for finding centers and medians in networks
• An Efficient Parallel Biconnectivity Algorithm
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time

This page was built for publication: An optimal parallel algorithm for computing furthest neighbors in a tree