A Family of Counter Examples to an Approach to Graph Isomorphism
classification
💻 cs.CC
cs.DM
keywords
counterexamplesfamilygraphisomorphismpolytopesalgorithmapproach
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.