search for: graph_matching_via_simul

...x has upper bound" since "Graph isomorphism where degree of vertex has upper bound" has tractable solution. This approach seems promising. > > > > I also came across solving Graph matching using Simulated Annealing (http://randomwalker.info/luther/kaggle-deanonymization/Graph_Matching_via_Simulate.html) which also seems promising. > > > > How do you feel about these? > > > > > >> > In the lpSolve document there does not seem to be any option where one can specify which variable should the optimizer use to use LP relaxation first? Is there way to co...