A simple parallel algorithm for computing the diameters of all vertices in a tree and its application

DOI10.1016/0020-0190(92)90031-PzbMath0764.68047MaRDI QIDQ1198069

Zhi-Zhong Chen

Publication date: 16 January 1993

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

zbMATH Keywords

treedistancescomputational complexityparallel algorithmsmaximal tree cover problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Distributed algorithms (68W15)

Related Items (1)

Minimizing diameters of dynamic trees

Cites Work

• Unnamed Item
• Optimal parallel algorithms on planar graphs
• A unified approach to parallel depth-first traversals of general trees
• A randomized NC algorithm for the maximal tree cover problem
• An Efficient Parallel Biconnectivity Algorithm
• Parallel Merge Sort
• A New Parallel Algorithm for the Maximal Independent Set Problem

This page was built for publication: A simple parallel algorithm for computing the diameters of all vertices in a tree and its application