Skip to main content
Springer Nature Link
Log in

Alogtime algorithms for tree isomorphism, comparison, and canonization

  • Invited Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1289))

Included in the following conference series:

  • 378 Accesses

Abstract

The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic to a given tree. The tree comparison problem is the problem of determining whether one tree is less than a second tree in a natural ordering on trees. We present alternating logarithmic time algorithms for the tree isomorphism problem, the tree canonization problem and the tree comparison problem. As a consequence, there is a recursive enumeration of the alternating log time tree problems.

Supported in part by NSF grants DMS-9503247 and DMS-9205181.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. D. A. M. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, J. Comput. System Sci., 38 (1989), pp. 150–164.

    Google Scholar 

  3. S. R. Buss, The Boolean formula value problem is in ALOGTIME, in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing, May 1987, pp. 123–131.

    Google Scholar 

  4. —, Algorithms for Boolean formula evaluation and for tree contraction, in Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajíček, eds., Oxford University Press, 1993, pp. 96–115.

    Google Scholar 

  5. S. R. Buss, S. A. Cook, A. Gupta, and V. Ramachandran, An optimal parallel algorithm for formula evaluation, SIAM J. Comput., 21 (1992), pp. 755–780.

    Google Scholar 

  6. P. B. Gibbons, R. M. Karp, G. L. Miller, and D. Soroker, Subtree isomorphism in in random NC, Discrete Applied Mathematics, 29 (1990), pp. 35–62.

    Google Scholar 

  7. N. Immerman, Languages that capture complexity classes, SIAM Journal on Computing, 16 (1987), pp. 760–778.

    Google Scholar 

  8. S. LINDELL, A logspace algorithm for tree canonization, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 400–404.

    Google Scholar 

  9. A. Lingas and M. Karpinski, Subtree isomorphism is NC reducible to bipartite perfect matching, Information Processing Letters, 30 (1989), pp. 27–32.

    Google Scholar 

  10. R. J. Lipton and Y. Zalcstein, Word problems solvable in logspace, J. Assoc. Comput. Mach., 24 (1977), pp. 522–526.

    Google Scholar 

  11. D. W. Matula, Subtree isomorphism in O(n5/2), Annals of Discrete Mathematics, 2 (1978), pp. 91–106.

    Google Scholar 

  12. G. L. Miller and J. H.Reif, Parallel tree contraction part 2: Further applications, SIAM Journal on Computing, 20 (1991), pp. 1128–1147.

    Google Scholar 

  13. W. L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci., 22 (1981), pp. 365–383.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Mathematics & Computer Science, Univ. of California, San Diego, 92093-0112, La Jolla, CA

    Samuel R. Buss

Authors
  1. Samuel R. Buss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buss, S.R. (1997). Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-63385-5_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63385-3

  • Online ISBN: 978-3-540-69806-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation