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

Ant colony optimization is a technique for optimization that was introduced in the early
1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

Optimization techniques inspired by swarm intelligence have become increasingly popular
during the last decade. They are characterized by a decentralized way of working that …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

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 …

In this paper we explore the design space of creating a multi-threaded graph partitioner. We
present and compare multiple approaches for parallelizing each of the three phases of …

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 …

Algorithms that nd good partitionings of unstructured and irregular graphs are critical for the
e cient execution of scienti c simulations on high performance parallel computers. In these …

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