Neural networks and NP-complete problems; a performance study of the graph bisectioning problem
Th e performance of a mean field th eory (MFT) neu ralnetwork technique for finding approximate solutions to optimi zationproblems is invest igat ed for the case of th e minimum cut graph bisection problem, which is NP- complete. We address the issues of solut ionquality, programming complexity, convergence tim es and scala bility.Both standard random gr aphs an d mor e st ruct ured geomet ric gra