The direct algorithm for solving of the graph isomorphism problem
Combinatorics
2007-05-23 v4
Abstract
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
Cite
@article{arxiv.math/0502251,
title = {The direct algorithm for solving of the graph isomorphism problem},
author = {Rashit T. Faizullin and Alexander V. Prolubnikov},
journal= {arXiv preprint arXiv:math/0502251},
year = {2007}
}
Comments
22 pages