GitHub

Mt-KaHyPar - Multi-Threaded Karlsruhe Graph and Hypergraph Partitioner

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 ...
IEEE

Research on Efficient Graph Partitioning Algorithms for Sparse Matrices

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 ...
GitHub

This is an implementation of the global paths matching algorithm.

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 ...
IEEE

Balanced Graph Partitioning: Optimizing graph cut based on Label Swapping

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 ...
Scientific Research Publishing

A Data Mining Based Approach to Customer Behaviour in an Electronic Settings ()

The understanding of customer incidents and behaviour is crucial to the success of any organization. Evidence from literature shows a prediction pattern of products to customer. These studies ...