The task is to take 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.
6 freelancer bu iş için ortalamada 26€ teklif veriyor
Expertise in graph theory and can provide you your complete task in decided time frame with quality. We can discuss further details in the message box Regards