Parallel algorithm for finding a core of a tree network
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ε{lunate}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. © 1994.
Source or Periodical Title
Information Processing Letters
ISSN
200190
Page
223-226
Document Type
Article
Subject
Core, Location problem, Optimal algorithm, Parallel algorithms, Tree
Recommended Citation
Albacea, Eliezer A., "Parallel algorithm for finding a core of a tree network" (2021). Journal Article. 3612.
https://www.ukdr.uplb.edu.ph/journal-articles/3612