The polynomial algorithm for graphs' isomorphism testing
组合数学
2007-05-23 v1 群论
摘要
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
引用
@article{arxiv.math/0202085,
title = {The polynomial algorithm for graphs' isomorphism testing},
author = {Aleksandr Golubchik},
journal= {arXiv preprint arXiv:math/0202085},
year = {2007}
}
评论
4 pages