Elsevier

Information Processing Letters

Volume 51, Issue 5, 12 September 1994, Pages 223-226
Information Processing Letters

Parallel algorithm for finding a core of a tree network

https://doi.org/10.1016/0020-0190(94)00102-2Get rights and content

Abstract

The core of a graph G is a path P in G that is central with respect to the property of minimizing d(P)= ∑vϵV d(v, P), where d(v, P) is the distance of vertex v from P. We present an optimal parallel algorithm for finding a core of a tree. The algorithm requires O(log n) time using n/log n processors on the EREW PRAM.

References (8)

There are more references available in the full text version of this article.

Cited by (0)

View full text