Pith. sign in

REVIEW 1 cited by

KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1311.1714 v9 pith:EBRAEOYD submitted 2013-11-07 cs.DC cs.DS

Peter Sanders , Christian Schulz This is my paper · ORCID
classification cs.DCcs.DS
keywords partitioningalgorithmsframeworkuserguidehighkahipkarlsruhe
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions provided within the framework. Since version 3.00 we support multilevel partitioning, memetic algorithms, distributed and shared-memory parallel algorithms, node separator and ordering algorithms, edge partitioning algorithms as well as ILP solvers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Free-Energy Machine for Combinatorial Optimization

    cond-mat.stat-mech 2024-12 conditional novelty 5.0 of 10

    Free-Energy Machine, a mean-field annealing method powered by automatic differentiation and parallel replicas, matches or beats specialized solvers on MaxCut, balanced MinCut, and Max k-SAT benchmarks.

Pith tools