Kevin Aydin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems: in some cases, a big graph is chopped into pieces that fit on one machine to be processed independently before stitching the results together, leading to certain suboptimality from the interaction among different pieces. In other cases, links between(More)
  • 1