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 …

Networks are everywhere: networks of friends, transportation networks and the Web.
Neurons in our brains and proteins within our bodies form networks that determine our …

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 …

Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect
more than two vertices. They have a similarly wide range of applications as graphs. This …

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 …

The amount of graph-structured data has recently experienced an enormous growth in many
applications. To transform such data into useful information, fast analytics algorithms and …

Loop-based microgrids are signified by their high reliability in islanded and grid-connected
operations. This paper proposes an iterative procedure for the optimal design of a microgrid …

In microgrid planning, topological design is a critical concern for ensuring certain features
such as high reliability in islanded operation. This paper proposes a graph partitioning and …

Graph partitioning is crucial to parallel computations on large graphs. The choice of
partitioning strategies has strong impact on not only the performance of graph algorithms …