Abstract
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 isoptimal 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 anoptimal edge ranking of a tree, placing the problem inP. An interesting feature of the algorithm is an unusual greedy procedure that allows us to narrow an exponential search space down to a polynomial search space containing an optimal solution. AnNC algorithm is presented that finds an optimal edge ranking for trees of constant degree. We also prove that a natural decision problem emerging from our sequential algorithm isP-complete.
Similar content being viewed by others
References
R. P. Brent, The parallel evaluation of general arithmetic expressions,Journal of the ACM,21 (1974), 201–206.
R. Cole, Parallel merge sort,SIAM Journal on Computing,17 (1988), 770–785.
P. de la Torre and R. Greenlaw, Super critical tree numbering and optimal tree ranking are in NC,Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, 1991, pp. 767–773.
P. de la Torre, R. Greenlaw, and T. M. Przytycka, The optimal tree ranking problem is inNC,Parallel Processing Letters,2 (1992), 31–41.
P. de la Torre, R. Greenlaw, and A. A. Schäffer, Optimal Edge Raking of Trees in Polynomial Time, Technical Report 92-10, University of New Hampshire, 1993.
P. de la Torre, R. Greenlaw, and A. A. Schäffer, A Note on Deogun and Peng's Edge Ranking Algorithm, Technical Report 93-13, University of New Hampshire, 1993.
J. S. Deogun and Y. Peng, Edge ranking of trees,Congressus Numerantium,79 (1990), 19–28.
M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
L. M. Goldschlager, R. A. Shaw, and J. Staples, The maximum flow problem is log space complete forP Theoretical Computer Science,21 (1982), 105–111.
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo,Limits to Parallel Computation: P-completeness Theory, Computing Science Series, editor Z. Galil, Oxford University Press, Oxford, 1995.
A. V. Iyer, H. D. Ratliff, and G. Vijayan, Optimal node ranking of trees,Information Processing Letters,28 (1988), 225–229.
A. V. Iyer, H. D. Ratliff, and G. Vijayan, On an edge ranking problem of trees and graphs,Discrete Applied Mathematics,30 (1991), 43–52.
J. M. Lewis and M. Yannakakis, The node-deletion problem for hereditary properties isNP-complete,Journal of Computer and System Sciences,20 (1980), 219–230.
Y. Liang, S. K. Dhall, and S. Lakshmivarahan, Parallel algorithms for ranking of trees,Proceedings of the Second Annual Symposium on Parallel and Distributed Computing, Dallas, TX, 1990, pp. 26–31.
N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms,Journal of the ACM,30 (1983), 852–865.
J. Nevins and D. Whitney, editors,Concurrent Design of Products and Processes, McGraw-Hill, New York, 1989.
Y. Perl and S. Zaks, On the complexity of edge labelings for trees,Theoretical Computer Science,19 (1982), 1–16.
T. M. Przytycka, The optimal tree ranking problem is inNC Manuscript, 1991.
A. A. Schäffer, Optimal node ranking of trees in linear time,Information Processing Letters,33 (1989/90), 91–96.
M. Yannakakis, Node-deletion problems on bipartite graphs,SIAM Journal on Computing,10 (1981), 310–327.
M. Yannakakis, Edge-deletion problems,SIAM Journal on Computing,10 (1981), 297–309.
X. Zhou and T. Nishizeki, An efficient algorithm for edge-ranking trees,Proceedings of the Second European Symposium on Algorithms, Utrecht, Lecture Notes in Computer Science, Volume 855, Springer-Verlag, Berlin, 1994, pp. 118–129.
X. Zhou and T. Nishizeki, Finding optimal edge-rankings of trees,Proceedings of the Sixth Annual Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 122–131.
Author information
Authors and Affiliations
Additional information
Communicated by N. Megiddo.
The research of P. de la Torre was partially supported by NSF Grant CCR-9010445. R. Greenlaw's research was partially supported by NSF Grant CCR-9209184. The research of A. A. Schäffer was partially supported by NSF Grant CCR-9010534.
Subsequent to the acceptance of this paper, Zhou and Nishizeki found faster algorithms for optimal edge ranking of trees, first reducing the time toO(n2) [22] and then toO(n logn) [23].
Rights and permissions
About this article
Cite this article
de la Torre, P., Greenlaw, R. & Schäffer, A.A. Optimal edge ranking of trees in polynomial time. Algorithmica 13, 592–618 (1995). https://doi.org/10.1007/BF01189071
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01189071