Neo4j Sweden Ab

Jacob Sznajdman

Adam Schill-Collberg

A method and high-performance apparatus for creating an approximate maximum k-cut of a graph. In various embodiments, nodes and weighted edges in a graph are used to compute a partitioning of a graph such that the edge weight between partitions is maximized. In various embodiments, the method and apparatus use a greedy random construction of cuts for its first approximation, whose solutions are then subject to local search for better solutions, and local path-relinking for the final level of refinement. In various embodiments, one or more of the greedy random construction, local search, and path relinking are parallelized. A novel parallel algorithm is disclosed for perturbing the state of a cut to see if a better one is cheaply available.

Growing community of inventors

Gothenburg, Sweden

Jacob Sznajdman