@@ -33,7 +33,7 @@ minimal communication then translates to the optimization problem of
finding a graph partitioning where each group contains the same sum of
weights, and the sum of the cut edges is minimal (_Find optimal decomposition_). As final step
the decomposition can be post-process further more to be for optimal, based on factors not considered by the optimization process, like merging vertex, or merging sub-sub-domain, to create bigger sub-domains.
Even if a model decomposition it is not bind to a graph model it is true that until now is the main approach
Even if a model decomposition it is not bind to a graph model it is true that until now it is the main approach
