Pinned Repositories
mt-kahypar
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
cluster_editing
KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint union of complete graphs) by performing a minimum number of edge editing operations.
experimental_plot_scripts
R scripts to evaluate hypergraph partitioning experiments.
Hypergraph
Hypergraph Structure
hypergraph_partitioner
Collection of (hyper)graph partitioners with a simple python interface for experiments.
HypergraphPartitioning
Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes
kahypar
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
kahypar-louvain
KaHyPar - Karlsruhe Hypergraph Partitioning
KaHyParMaxFlow
ProblemSolving
Solved problems from UVA and the ICPC live archive
kittobi1992's Repositories
kittobi1992/cluster_editing
KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint union of complete graphs) by performing a minimum number of edge editing operations.
kittobi1992/ProblemSolving
Solved problems from UVA and the ICPC live archive
kittobi1992/hypergraph_partitioner
Collection of (hyper)graph partitioners with a simple python interface for experiments.
kittobi1992/experimental_plot_scripts
R scripts to evaluate hypergraph partitioning experiments.
kittobi1992/Hypergraph
Hypergraph Structure
kittobi1992/HypergraphPartitioning
Hypergraph Partitioning: benchmarks, evaluators, best known solutions and codes
kittobi1992/kahypar
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
kittobi1992/kahypar-louvain
KaHyPar - Karlsruhe Hypergraph Partitioning
kittobi1992/KaHyParMaxFlow
kittobi1992/parkway
Parallel hypergraph partitioning in C++ using MPI.
kittobi1992/pybind11-tutorial
kittobi1992/rlcsa-experiments
kittobi1992/rmq-experiments
kittobi1992/sdsl-lite
Succinct Data Structure Library 2.0
kittobi1992/ShizophrenicQuicksort