The task is to solve a problem with Constraint Programming. The problem is to take a given graph as input with n nodes and it must be divided into two subgraphs with plenty of nodes equal(e.g n/2 each one) or difference by 1 node if needed. Furthermore, The purpose is to find optimal partition, more specific the number of edges between each partition must be minimized. I want this to be made in Prolog with one of the following tools you can choose (ECLiPSe,GNU Prolog,SWI Prolog).
9 freelancers are bidding on average €87 for this job
I have some experience in prolog projects. To solve this graph partitioning problem in prolog, when performance is not a requirement, is not a difficult task.