2-Club Program -- Sepp Hartung, Christian Komusiewicz, and AndrĂ© Nichterlein
TwoClub.jar is a free Java program that provides an implementation of a search tree algorithm for the 2-Club problem.
See the paper "On Structural Parameterizations for the 2-Club Problem" by Sepp Hartung, Christian Komusiewicz and Andr\'e Nichterlein publicated in the Proceedings of SOFSEM'13 for a detailed describtion.
The program is distributed under the terms of the GNU General Public License (GPL). It is written in Java and requires a Java Virtual Machine which is compatible to version 1.6. It can be invoked by
java -jar TwoClub.jar FILENAME
The parameter FILENAME points to the file that describes the input graph.
The given name (FILENAME) must either end on ".graph" or on ".dimacs". If ending on ".graph", then the corresponding file will be parsed as a Metis graph. If ending on ".dimacs", then it will be parsed as DIMACS graph.
For instance the program can be invoked with
java -jar TwoClub.jar example.dimacs
The example graph "example.dimacs" can be found in the same folder as the program.
The program outputs several graph paramaters and, among them, the maximum 2-club of the given graph.
There is a second optional argument specifying which solver is used. Default is the search tree algorithm without Turing kernelization, but the following invokes the search tree algorithm with Turing kernelization running ahead (strategy DEG, see the paper):
java -jar TwoClub.jar example.dimacs 2