Given a weighted DAG (Directed Acyclic Graph), the objects are following: 1. Partition the graph in K partitions ( K will be given as input) so that all the partitions contains almost same number of nodes. 2. The average weight (Weight is on the edge) should be ssame (almost same) in all the partition. Goal is to write an algorithm, analysis of the time complexity and implementation. Extra information: the edge weights are [0, 1] Thabk you in advance.
Linear Programming is a mathematical technique working with linear relations. It is best worked on by mathematicians skilled in this discipline. If your business needs help working with Linear Programming then you can use the services offered by our freelancers. Start by posting your project on this website. Contratar a Linear Programming Engineers
Propose and Analysis a graph theoretic algorithm 4 días left
$24 (Avg Bid)
$24 Oferta promedio