Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary cost over all parts is small.Here, this partitioning problem is considered for …