×

A new algorithm for solving the tree isomorphism problem. (English) Zbl 0529.68038


MSC:

68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Read, C. R., Corneil, D. G.: The graph isomorphism disease. JGT1, 339 (1977). · Zbl 0381.05026 · doi:10.1002/jgt.3190010410
[2] Busacker, R. G., Saaty, T. L.: Finite graphs and networks, p. 196. New York: McGraw-Hill 1965. · Zbl 0146.20104
[3] Corneil, D. G., Gotlieb, C. C.: An efficient algorithm for graph isomorphism. JACM17, 51 (1970). · Zbl 0199.27801 · doi:10.1145/321556.321562
[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.
[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.
[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.
[7] Tarjan, R. E.: Graph Algorithms in Chemical Computation, p. 1. 1977.
[8] Harrary, F.: Graph Theory. Reading: 1969. · Zbl 0141.41202
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.