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 …

In this chapter we look at JOSTLE, the multilevel graph-partitioning software package, and
highlight some of the key research issues that it addresses. We first outline the core …

Rapid progress in unconstrained face recognition has resulted in a saturation in recognition
accuracy for current benchmark datasets. While important for early progress, a chief …

Graph partitioning (GP) applications are ubiquitous throughout mathematics, computer
science, chemistry, physics, bio-science, machine learning, and complex systems. Post …

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 …

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 …

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 …

The independent set problem is NP-hard and particularly difficult to solve in large sparse
graphs, which typically take exponential time to solve exactly using the best-known exact …

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