An efficient algorithm for edge-ranking trees
An edge-ranking of an undirected graph G is a labeling of the edges of G with integers such that all paths between two edges with the same label i contain an edge with label j>i. The problem of finding an edge-ranking of G using a minimum number of ranks has applications in scheduling the manufacture of complex multi-part products; it is equivalent to finding the minimum height edge separator tree. Deogun and Peng and independently de la Torre et al. have given polynomialtime algorithms which find an edge-ranking of trees T using a minimum number of ranks in time O(n3) and O(n3 log n) respectively, where n is the number of nodes in T. This paper presents a more efficient and simple algorithm, which finds an edge-ranking of trees using a minimum number of ranks in O(n2) time.
Unable to display preview. Download preview PDF.
- [BDJ+94]H. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, and Zs. Tuza. Ranking of graphs. In Proc. of International Workshop on Graph-Theoretic Concepts in Computer Science, Herrsching, Bavaria, Germany, 1994.Google Scholar
- [dlTGS93]P. de la Torre, R. Greenlaw, and A. A. Schäffer. Optimal ranking of trees in polynomial time. In Proc. of the 4th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 138–144, Austin, Texas, 1993.Google Scholar
- [IRV88b]A.V. Iyer, H.D. Ratliff, and G. Vijayan. Parallel assembly of modular products — an analysis. Technical Report PDRC, Technical Report 88-06, Georgia Intitute of Technology, 1988.Google Scholar
- [KMS88]M. Katchalski, W. McCuaig, and S. Seager. Ordered colourings. manuscript, University of Waterloo, 1988.Google Scholar
- [Pot88]A. Pothen. The complexity of optimal elimination trees. Technical Report CS-88-13, Pennsylvania State University, U.S.A., 1988.Google Scholar