Parallel Edge Ranking of TreesResearch Paper
An edge ranking of a tree assigns positive integer ranks to its edges so that the path between any two distinct edges of equal rank contains an edge of higher rank. The edge ranking number is the least possible maximum rank. This number gives the minimum worst-case number of edge queries needed to locate a target element in a tree, the…