|
|
|
|
|
Kevin Aydin, MohammadHossein Bateni and Vahab Mirrokni
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the results ...
ver más
|
|
|
|
|