Computer Science – Computational Complexity
Scientific paper
2008-01-11
Computer Science
Computational Complexity
Scientific paper
We give a family of counter examples showing that the two sequences of
polytopes $\Phi_{n,n}$ and $\Psi_{n,n}$ are different. These polytopes were
defined recently by S. Friedland in an attempt at a polynomial time algorithm
for graph isomorphism.
Cai Jin-Yi
Lu Pinyan
Xia Mingji
No associations
LandOfFree
A Family of Counter Examples to an Approach to Graph Isomorphism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Family of Counter Examples to an Approach to Graph Isomorphism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Family of Counter Examples to an Approach to Graph Isomorphism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547820