Skip to main content
SpringerLink
Log in

A new algorithm for solving the tree isomorphism problem

Ein neuer Algorithmus zur Lösung des Baum-Isomorphismus-Problems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The problem and known algorithms for its solution are briefly discussed. An efficient algorithm for canonical coding of unlabelled trees is described. Several applications of the code, including the tree isomorphism problem, are considered. Efficiency of the algorithm is evaluated and discussed.

Zusammenfassung

Das Problem und die bekannten Algorithmen für seine Lösung werden kurz besprochen. Ein wirksamer Algorithmus für kanonische Kodierung von nicht indizierten Bäumen wird gegeben. Einige Anwendungen des Kodes, u. a. auf das Baum-Isomorphismus-Problem, werden erörtert. Die Wirksamkeit des Algorithmus wird bewertet und diskutiert.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Read, C. R., Corneil, D. G.: The graph isomorphism disease. JGT1, 339 (1977).

    Google Scholar 

  2. Busacker, R. G., Saaty, T. L.: Finite graphs and networks, p. 196. New York: McGraw-Hill 1965.

    Google Scholar 

  3. Corneil, D. G., Gotlieb, C. C.: An efficient algorithm for graph isomorphism. JACM17, 51 (1970).

    Article  Google Scholar 

  4. Jovanović, A. D., Danilović, D. Ž.: A new algorithm for solving the tree isomorphism problem. Proc. XXII Jugoslav Conf. ETAN, p. 1/177. Beograd: ETAN 1978.

    Google Scholar 

  5. Danilović, D. Ž., Jovanović, A. D.: Improvement and computer realization of Edmond's algorithm for tree isomorphism. Proc. Jugoslav Conf. Jahorina, p. 302/1. Sarajevo: Faculty of Electr. Engng. 1978.

    Google Scholar 

  6. Jovanović, A. D., Danilović, D. Ž.: Survey of Algorithms for Examining isomorphism of trees. Proc. XXV Jugoslav Conf. ETAN, p. 1/295. Beograd. ETAN 1981.

    Google Scholar 

  7. Tarjan, R. E.: Graph Algorithms in Chemical Computation, p. 1. 1977.

  8. Harrary, F.: Graph Theory. Reading: 1969.

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, University of Belgrade, P.O. B. 816, YU-11001, Belgrade, Yugoslavia

    A. Jovanović

  2. Institute of Applied Physics, Bull. Lenjina 165b, YU-11000, Belgrade, Yugoslavia

    D. Danilović

Authors
  1. A. Jovanović
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Danilović
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jovanović, A., Danilović, D. A new algorithm for solving the tree isomorphism problem. Computing 32, 187–198 (1984). https://doi.org/10.1007/BF02243572

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02243572

AMS Subject Classifications

Key words

Search

Navigation