  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.
