ProjectKaHIP's profile picture. Karlsruhe High Quality Graph Partitioning

Project KaHIP

@ProjectKaHIP

Karlsruhe High Quality Graph Partitioning

Pinned

KaHIP is now under MIT license.


KaHIP can now be used in Python ...


KaHIPv2.1 is out now! goo.gl/bjTQEC . Major update: including edge partitioning algorithms (due to Daniel Seemaier) and switched to MIT license.


We just release VieM (Vienna Mapping and Sparse Quadratic Assignment). Link: goo.gl/5r3cXz


KaHIPv2.0 is out now! goo.gl/bjTQEC. Major update: including highly parallel as well as mapping algorithms.


We are preparing KaHIP v2.0. Stay tuned!


We released Karlsruhe Longest Paths (KaLP): compute longest paths by dynamic programming using KaHIP. Link: goo.gl/pw5IP2


Our recent results on computing k-way node separators: arxiv.org/pdf/1702.01692…


We just released KaHIP v1.0! goo.gl/tFZn7H


Our latest result: Scalable Generation of Scale-Free Graphs. Generate a Petaedge graph in less than an hour #bigdata arxiv.org/pdf/1602.07106


Our latest results: accelerating local search for the maximum independent set problem: arxiv.org/pdf/1602.01659….


We just released KaMIS (Karlsruhe Maximum Indpendent Sets), a tool to compute independent sets in huge sparse graphs algo2.iti.kit.edu/kamis/


Our latest result: k-way hypergraph partitioning via n-level recursive bisection. arxiv.org/abs/1511.03137. Main work by Sebastian Schlag.


Today, we released KaDraw (Karlsruhe Graph Drawing), a tool to draw graphs with small maxent-stress. Download: algo2.iti.kit.edu/kadraw/


Our latest result: n-level hypergraph partitioning with world class solution quality goo.gl/SqvYtF. Main work by Sebastian Schlag.


United States Trends

Loading...

Something went wrong.


Something went wrong.