Mt-KaHyPar is a shared-memory algorithm for partitioning graphs and hypergraphs. The balanced (hyper)graph partitioning problem asks for a partition of the node set of a (hyper)graph into k disjoint ...

Combinatorial optimization problems (COPs) encompass a class of problems that are aimed at finding optimal or near-optimal solutions within a finite solution space and that are prevalent in both ...

Abstract: For accelerating the convergence of numerical computation of sparse matrices, the classical approach is to partition sparse matrices into block-diagonal structures by graph partitioning ...

In recent years, with the rapid development of technologies such as mobile internet, the internet of things, social networks, and big data processing, various industries have begun to generate vast ...

The Global Paths Algorithm (GPA), was proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07) as a synthesis of Greedy and Path Growing algorithms by Drake ...

Abstract: Balanced Graph Partitioning is one of the fundamental combinatorial optimization problems. It is still a challenge to effectively achieve a High-quality Balanced Graph Partitioning for super ...

We provide background information allowing an informed discussion on the parallel performance of the basic solvers laplacianFOAM, scalarTransportFOAM and potentialFOAM. Most our discussion carries ...

This paper discusses techniques for solving discrete optimization problems using quantum annealing. Practical issues likely to affect the computation include precision limitations, finite temperature, ...

We present a system that can reconstruct 3D geometry from large, unorganized collections of photographs such as those found by searching for a given city (e.g., Rome) on Internet photo-sharing sites.

In this study, the feasibility of conducting in silico experiments in near-realtime with anatomically realistic, biophysically detailed models of human cardiac electrophysiology is demonstrated using ...