The polynomial algorithm for graphs' isomorphism testing
Combinatorics
2007-05-23 v1 Group Theory
Abstract
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
Cite
@article{arxiv.math/0202085,
title = {The polynomial algorithm for graphs' isomorphism testing},
author = {Aleksandr Golubchik},
journal= {arXiv preprint arXiv:math/0202085},
year = {2007}
}
Comments
4 pages