|
Zapiski Nauchnykh Seminarov LOMI, 1984, Volume 137, Pages 80–86
(Mi znsl4787)
|
|
|
|
Linear-time recognition of tree-pictures isomorphism
A. N. Grigor'eva
Abstract:
Tree-picture is an image of a tree on the plane. The isomorphism of tree-pictures is considered as the coincidence of the Images up to an isotopy of the plane. This notion suits more the pattern-recognition problems, rather than the isomorphism of the trees as abstract graphs. Tree-picture is determined (up to an isomorphism) by local orientations of its vertices, i. e. for each vertex corresponds a list of adjacent edges in the clockwise order. A linear-time algorithm for finding the maximal (relatively to the lexicographical order) among the strings, whose letters are integers, cyclically equal to a given one, is suggested. Basing on it a linear-time recognising of tree-pictures is produced.
Citation:
A. N. Grigor'eva, “Linear-time recognition of tree-pictures isomorphism”, Computational complexity theory. Part II, Zap. Nauchn. Sem. LOMI, 137, "Nauka", Leningrad. Otdel., Leningrad, 1984, 80–86
Linking options:
https://www.mathnet.ru/eng/znsl4787 https://www.mathnet.ru/eng/znsl/v137/p80
|
Statistics & downloads: |
Abstract page: | 107 | Full-text PDF : | 41 |
|