search for: kohenan

...;> with 2000 variables. It can solve some problems with a few hundreds of variables, > >> but not every such problem. > >> > > > > OK. I guess then my approach to solve the Graph matching problem using binary opt pr. seems destined to fail. I know you told about Kohenan maps but I am not exited about it since it some sort of neural network which involves training. So that approach may not be suitable. > > I wrote about another approach, reducing the "Graph matching with upper bound on degree of vertex" to "Graph isomorphism where degree of ve...