In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

The maximum cardinality and maximum weight matching problems can be solved in Õ (m√
n) time, a bound that has resisted improvement despite decades of research.(Here m and n …

We present a novel local improvement scheme for graph partitions that allows to enforce
strict balance constraints. Using negative cycle detection algorithms this scheme combines …

Processing large complex networks like social networks or web graphs has attracted
considerable interest. To do this in parallel, we need to partition them into pieces of roughly …

We present a multi-level graph partitioning algorithm using novel local improvement
algorithms and global search strategies transferred from multigrid linear solvers. Local …

2 the assembled benchmark suite, the challenges create a reproducible picture of the state
of the art in the area under consideration. This helps to foster an effective technology transfer …

Graphs that model social networks, numerical simulations, and the structure of the Internet
are enormous and cannot be manually inspected. A popular metric used to analyze these …

Emerging quantum processors provide an opportunity to explore new approaches for
solving traditional problems in the post Moore's law supercomputing era. However, the …

We present a novel approach to graph partitioning based on the notion of cuts. Our
algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut …