The task is to solve graph partition with constraints by taken a given graph as input and the it must be divided into two subgraphs with plenty of nodes equal or difference by 1. The purpose is to find optimal partition, more specific the number of edges between each partition must be [url removed, login to view] restrictions is to solve the problem with Constraint Satisfaction. In addition you will use java with Jacop library which is suitable for constraint programming.i can give more directions in chat.
The problem is trivial,simple and clear.
3 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön
Hi! I'm interesting your project very well. I am mastering c++ and I'm a good Mathematician. And also I have many experience and good skill about graph algorithm. Let's go ahead with me