Main Content


A tool to find a subgraph of fixed size k maximizing a specific objective function in a graph. For example FixCon can find the densest subgraph with k vertices in a graph.

Download the program here:

Python version (developed in Python 3.6): FixCon

Kotlin (Java) version (developed in openjdk 17): FixCon-Java

If you use FixCon in scientific publication, please cite:

Christian Komusiewicz and Frank Sommer: FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. In Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX ’20), Salt Lake City, USA, January 2020. Pages 12-26, SIAM.