PARALLEL ALGORITHM FOR FINDING A CORE OF A TREE NETWORK

作     者：ALBACEA, EA 

作者机构：Computer Science Laboratory University of the Philippines at Los Banos 4031 College Laguna Philippines 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：1994年第51卷第5期

页      面：223-226页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：TREE LOCATION PROBLEM CORE PARALLEL ALGORITHMS OPTIMAL ALGORITHM 

摘      要：The core of a graph G is a path P in G that is central with respect to the property of minimizing d(P) = Sigma(v is an element of 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.