Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Architectures for Parallel Processing

ICA3PP 2009: Algorithms and Architectures for Parallel Processing pp 384–395Cite as

An On-Line Parallel Algorithm for Node Ranking of Trees

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5574))

Abstract

A node ranking of a graph G = (V, E) is a proper node coloring C: V →ℕ such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) > C(x). In the on-line version of the node ranking problem, the nodes v 1, v 2,..., v n are coming one by one in an arbitrary order; and only the edges of the induced subgraph G[{v 1, v 2,..., v i }] are known when the color for the node v i be chosen. And the assigned color can not be changed later. In this paper, we present a parallel algorithm to find an on-line node ranking for general tree. Our parallel algorithm needs O(nlog2 n ) time with using O(n 3 / log2 n) processors on CREW PRAM model.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbas, N., Stewart, L.K.: Biconvex Graphs: Ordering and Algorithms. Discrete Applied Mathematics 103, 1–19 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Akl, S.G.: Parallel Computation: Models and Methods. Prentice Hall, NJ (1997)

    Google Scholar 

  3. Balakrishnan, R., Ranganathan, K.: A Textbook of Graph Theory. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  4. Bodlaender, H.L., Gilbert, J.R., Hafsteninsson, H., Kloks, T.: Approximating Treewidth, Pathwidth and Minimum Elimination Tree Height. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 1–12. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  5. Bruoth, E., Horňák, M.: On-Line Ranking Number for Cycles and Paths. Discussiones Mathematicae, Graph Theory 19, 175–197 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Deogun, J.S., Kloks, T., Kratsch, D., Müller, H.: On Vertex Ranking for Permutation and Other Graph. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 747–758. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Duff, I.S., Reid, J.K.: The Multifrontal Solution of Indefinite Sparse Symmetric Linear Equations. ACM Transactions on Mathematical Software 9, 302–325 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hashem, T., Paul, U.K., Kashem, M.A.: An Algorithm for c-Vertex-Ranking of Starlike Graphs. In: Proceeding of 4th International Conference on Electrical and Computer Engineering ICECE 2006, Dhaka, Bangladesh, pp. 316–319 (2006)

    Google Scholar 

  9. Hsieh, S.Y.: On Vertex Ranking of a Starlike Graph. Information Processing Letters 82, 31–135 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal Node Ranking of Trees. Information Processing Letters 28, 225–229 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Iyer, A.V., Ratliff, H.D., Vijayan, G.: Parallel Assembly of Modular Products-an Analysis. Technical Report, pp. 88–86, Georgia Institute of Technology, Atlanta, GA (1988)

    Google Scholar 

  12. Iyer, A.V., Ratliff, H.D., Vijayan, G.: On Edge Ranking Problems of Trees and Graphs. Discrete Applied Mathematics 30, 43–52 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. JáJá, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

  14. Kashem, M.A., Rahman, M.Z.: An optimal parallel algorithm for c-vertex-ranking of trees. Information Processing Letters 92(4), 179–184 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kashem, M.A., Zhou, X., Nishizeki, T.: Algorithms for generalized vertex-rankings of partial k-trees. Theoretical Computer Science 240(2), 407–427 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Katchalski, M., McCuaig, W., Seager, S.: Ordered Colorings. Discrete Mathematics 142, 141–154 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kloks, T., Müller, H., Wong, C.K.: Vertex Ranking of Asteroidal Triple-Free Graphs. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 174–182. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  18. Lee, C.W., Juan, J.S.T.: On-Line Ranking Algorithm for Trees. In: Proceeding of the 2005 International Conference on Foundations of Computer Science, Monte Carlo Resort, Las Vegas, Nevada, USA, June 27-30, pp. 46–51 (2005)

    Google Scholar 

  19. Leiserson, C.E.: Area Efficient Graph Layouts for VLSI. In: Proceeding of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 270–281 (1980)

    Google Scholar 

  20. Liang, Y., Dhall, S.K., Lakshmivarahan, S.: Parallel Algorithm for Ranking of Trees. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, pp. 26–31 (1990)

    Google Scholar 

  21. Liu, C.M., Yu, M.S.: An Optimal Parallel Algorithm for Node Ranking of Cographs. Discrete Applied Mathematics 87, 187–201 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  22. Liu, J.W.H.: The Role of Elimination Trees in Sparse Factorization. SIAM Journal of Matrix Analysis and Applications 11, 134–172 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Schäffer, A.A.: Optimal Node Ranking of Trees in Linear Time. Information Processing Letters 33, 91–96 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  24. Schiermeyer, I., Tuza, Zs., Voigt, M.: On-Line Rankings of Graphs. Discrete Mathematics 212, 141–147 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  25. Semanišin, G., Soták, R.: On-Line Ranking Number of Certain Classes of Graphs. In: Proceedings of the 4th Cracow Conference on Graph Theory (2002)

    Google Scholar 

  26. Sen, A., Deng, H., Guha, S.: On a Graph Partition Problem with Application to VLSI Layout. Information Processing Letters 43, 87–94 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  27. Torre, P., Greenlaw, R., Schäffer, A.A.: Optimal Edge Ranking of Trees in Polynomial Time. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms Austin, Texas, pp. 138–144 (1993)

    Google Scholar 

  28. Wang, C.W., Yu, M.S.: An Algorithm for the Optimal Ranking Problem on Interval Graphs. In: Proceedings Joint Conference of International Computer Symposium, International Conference on Algorithms, pp. 51–58 (1996)

    Google Scholar 

  29. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)

    Google Scholar 

  30. Yu, M.S.: Optimal Node Ranking of Cographs. In: Proceedings of International Computer Symposium, Taiwan, pp. 1–6 (1994)

    Google Scholar 

  31. Zhou, X., Nagai, N., Nishizeki, T.: Generalized vertex-rankings of trees. Information Processing Letters 56(6), 321–328 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan

    Chia-Wei Lee

  2. Department of Computer Science and Information Engineering, National Chi Nan University, No. 1, University Road, Puli, Nantou 545, Taiwan

    Justie Su-Tzu Juan & Tai-Lung Wu

Authors
  1. Chia-Wei Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Justie Su-Tzu Juan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tai-Lung Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, 106, Taipei City, Taiwan, ROC

    Arrems Hua  & Shih-Liang Chang  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, CW., Juan, J.ST., Wu, TL. (2009). An On-Line Parallel Algorithm for Node Ranking of Trees. In: Hua, A., Chang, SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03095-6_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03094-9

  • Online ISBN: 978-3-642-03095-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation