A Family of Counter Examples to an Approach to Graph Isomorphism
Computational Complexity
2008-01-14 v2 Discrete Mathematics
Abstract
We give a family of counter examples showing that the two sequences of polytopes and are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
Cite
@article{arxiv.0801.1766,
title = {A Family of Counter Examples to an Approach to Graph Isomorphism},
author = {Jin-Yi Cai and Pinyan Lu and Mingji Xia},
journal= {arXiv preprint arXiv:0801.1766},
year = {2008}
}