|
Prikladnaya Diskretnaya Matematika, 2010, supplement № 3, Pages 97–98
(Mi pdm215)
|
|
|
|
Applied Theory of Coding, Automata and Graphs
On a new complete invariant for acyclic graphs
A. V. Prolubnikov Omsk State University, Omsk
Abstract:
A new complete invariant for acyclic graphs is presented. An algorithm for solution of the graph isomorphism problem is considered. The algorithm is based on the invariant and gives solution of the problem for a wide graph class.
Citation:
A. V. Prolubnikov, “On a new complete invariant for acyclic graphs”, Prikl. Diskr. Mat., 2010, supplement № 3, 97–98
Linking options:
https://www.mathnet.ru/eng/pdm215 https://www.mathnet.ru/eng/pdm/y2010/i12/p97
|
Statistics & downloads: |
Abstract page: | 193 | Full-text PDF : | 94 | References: | 27 |
|