Propose and Analysis a graph theoretic algorithm
Budget: €8 – €30 EUR
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.
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.