[DMANET] CHSZLabLib: Python Interface to State-of-the-Art Graph Algorithm Libraries

Dear colleagues, We are pleased to announce CHSZLabLib, an open-source Python library that provides a unified interface to a collection of high-performance C++ algorithm libraries developed by the Algorithm Engineering Group at Heidelberg University. The library covers a broad range of combinatorial optimization problems on graphs and hypergraphs: - Graph partitioning (KaHIP, HeiStream, SharedMap) - Hypergraph partitioning (FREIGHT) - Community detection and clustering (VieClus, SCC, CluStRE, HeidelbergMotifClustering) - Minimum and maximum cuts (VieCut, fpt-max-cut, HeiCut) - Maximum (weight) independent set (KaMIS, CHILS, LearnAndReduce) - Hypergraph independent set and b-matching (HyperMIS, HeiHGM) - Maximum 2-packing set (red2pack) - Edge orientation (HeiOrient) - Fully dynamic graph algorithms for matching, edge orientation, and weighted independent set (DynMatch, DynDeltaOrientation, DynDeltaApprox, DynWMIS) In total, the library integrates 20 C++ solver libraries (350,000+ lines of C++) behind a consistent Python API with Graph/HyperGraph objects and typed result dataclasses. Pre-built wheels are available for Linux (x86_64) and macOS (arm64); no C++ compiler is required for installation. Installation: pip install chszlablib The library is intended for convenient access and rapid prototyping. For scientific studies and performance measurements, we recommend using the original C++ repositories directly (linked in the README), which provide full documentation, parameter spaces, and experimental setups. Please cite the original papers for each algorithm used; all references are listed in the repository. GitHub: https://github.com/CHSZLab/CHSZLabLib PyPI: https://pypi.org/project/chszlablib/ License: MIT Best regards, Christian Schulz Heidelberg University ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************