an:00765173
Zbl 0826.68093
de la Torre, P.; Greenlaw, R.; Sch??ffer, A. A.
Optimal edge ranking of trees in polynomial time
EN
Algorithmica 13, No. 6, 592-618 (1995).
00026657
1995
j
68R10 68M20
edge ranking; height edge-separator tree; trees
Summary: An edge ranking of a graph is a labeling of the edges using positive integers such that all paths between two edges with the same label contain an intermediate edge with a higher label. An edge ranking is optimal if the highest label used is as small as possible. The edge- ranking problem has applications in scheduling the manufacture of complex multipart products; it is equivalent to finding the minimum height edge- separator tree. In this paper we give the first polynomial-time algorithm to find an optimal edge ranking of a tree, placing the problem in \({\mathcal P}\). An interesting feature of the algorithm is an usual greedy procedure that allows us to narrow an exponential search space down to a polynomial search space containing an optimal solution. An \({\mathcal {NC}}\) algorithm is presented that finds an optimal edge ranking for trees for constant degree. We also prove that a natural decision problem emerging from our sequential algorithm is \({\mathcal P}\)-complete.