Advertisement

Unordered tree contraction

  • Lih-Hsing Hsu
  • Jones J. J. Wang
Parallel Processing And Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)

Abstract

The tree contraction problem is for reducing a rooted tree to its root by a sequence of independent vertex removals. All of the previous research works are concentrated on ordered rooted tree whereas in this paper we are going to discuss the case of unordered rooted tree.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    K. Abrahamson, N. Dadoun, D. G. Kirpatrick and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989), 287–302.CrossRefGoogle Scholar
  2. 2.
    I. Bar-On and U. Vishkin, Optimal parallel generation of a compution tree form, ACM Trans. Programm. Lang. System 7, No. 2 (1985), 348–357.CrossRefGoogle Scholar
  3. 3.
    M. W. Bern, E. L. Lawler and A. L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8 (1987), 216–235.CrossRefGoogle Scholar
  4. 4.
    F. Y. Chin, J. Lam and I. Chan, Efficient parallel algorithms for some graph problems, Commun. ACM 25, No. 9 (1982), 659–665.CrossRefGoogle Scholar
  5. 5.
    A. Gibbons and W. Rytter, Optimal parallel algorithms for dynamic expression and context-free recognition, Inform. and Comput. 81 (1989), 32–45.CrossRefGoogle Scholar
  6. 6.
    L. H. Hsu and S. Y. Wang, Maximum independent number for series-parallel networks, to appear at Networks.Google Scholar
  7. 7.
    L. H. Hsu and S. Y. Wang, Maximum matching for series-parallel networks, submitted to Discrete Applied Math.Google Scholar
  8. 8.
    L. H. Hsu, Y. C. Chang and T. Y. Ho, Double Euler trail on series-parallel networks, submitted to Discrete Applied Math.Google Scholar
  9. 9.
    X. He and Y. Yesha, Binary tree algebraic computation and parallel algorithms for simple graphs, J. Algorithms 9 (1988), 92–113.CrossRefGoogle Scholar
  10. 10.
    G. L. Miller and J. H. Reif, Parallel tree contraction and its application, in "26th IEEE Symp. on Foundations of Comput. Sci., 1985," 478–489.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Lih-Hsing Hsu
    • 1
  • Jones J. J. Wang
    • 1
  1. 1.Department of Information and Computer ScienceNational Chiao Tung UniversityHsinchuTaiwan, Republic of China

Personalised recommendations