By Topic

Parallel algorithms for ranking of trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Y. Liang ; Sch. of Electr. Eng. & Comput. Sci., Oklahoma Univ., OK, USA ; S. K. Dhall ; S. Lakshmivarahan

Ranking a tree is defined as a mapping ρ of the nodes to the set {1, 2, . . .} such that if there is a path from u to v and ρ(u)=ρ(v) then there is a node w on the path from u to v such that ρ(w)>ρ(u). The highest number assigned to the node is called the rank number of the mapping. A mapping ρ with the smallest rank number is called optimal ranking. The best known serial algorithm takes O(n) time for the optimal node ranking. However, the problem of finding the optimal tree ranking appears to be highly sequential. It remains open whether it is in NC. The paper proposes a fast parallel algorithm for finding approximate optimal node ranking of trees using O(logn) steps with n2 processors on a CRCW PRAM and an efficient parallel algorithm using O(log2n) steps with n processors on a EREW model

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990