Usage:
java -jar wc2club.jar input-graph [parameters]
The first argument must always be the name of the input file.
Following options can be added after the filename:
-vb Solve for the robust 2-club model of Veremyev/Boginski.
(Adjacent vertices also require t neighbors.)
-tc Solve for the t-connected 2-club model.
(Resulting 2-club has to be t-connected)
Note:
If neither the -vb nor -tc flag is set, then the program finds.
the largest (t-1)-hereditary 2-club.
(A t-robust 2-club is a (t-1)-hereditary 2-club.)
(A t-hereditary 2-club with at least t+2 vertices is a (t+1)-connected 2-club.)
-out PREFIX Write solution(s) to output file(s) starting with string PREFIX.
Program will append value of parameter t and ending '.dimacs'.
For each choice of the parameter t one output file will be generated.
Output files are in DIMACS format and located in directory 'output'.
Default: No output files will be generated.
-t X Run algorithm for parameter t = X.
Note: If you want to compute a X-hereditary 2-club you have to type '-t X+1'.
(See relationship of t-robust and (t-1)-hereditary 2-clubs.
-t MIN-MAX Run algorithm for parameter values MIN to MAX.
Default: Run algorithm for every possible value of t.
-min X Only look for solutions of size at least X.
-metis Tell program that input is a Metis file.
-dimacs Tell program that input is a DIMACS file.
-clq Tell program that input is a DIMACS clq file.
The program normally guesses the correct file type by its ending.
-silent Generate no console output whatsoever when running algorithm.
(only makes real sense when generating output files)
-verbose Generate more detailed console output when running algorithm.
-nokernels Tells the program to NOT kernelize the graph, but try to solve it all at once.
-drop X Tells the program to drop the first X kernels during each search.
Useful when the algorithm was previously run for the first X kernels.
-timeout X Sets time limit for each value of t to X seconds.
Other algorithms, as for instance those used for graph analysis
are also subject to this timeout. Timed out algorithms are
not guaranteed to produce optimal solutions.
-aX Analysis level of the algorithm. How much information about the input graph
and solutions will be generated. Replace X by 0-4. Default is 1.
Level 0: Do not analyze the graphs.
Level 1: Only generate basic information computable in linear time.
Level 2: Generate additional information requiring higher order polynomial time.
Level 3: Most information. Warning: Requires solving NP-hard problems.
Results of the analysis can be found in the headers of generated output files.
Furthermore analysis results of the input will be output to the console if not
using -silent, as well as results for the solutions if using -verbose.
To run a correctness self test of the algorithm: java RobustTwoClub -selftest
To run a self test for t-robust variant: java RobustTwoClub -selftestvb
To run a self test for t-connected variant: java RobustTwoClub -selftesttc
To show this usage information: java RobustTwoClub -help
Examples:
Compute the largest 10-hereditary 2-club in graph.dimacs and output the solution size on the console:
java -jar wc2club.jar graph.dimacs -t 11
Compute the largest 4-robust 2-club in graph.dimacs and write the solution to a file in the subdirectory 'output':
java -jar wc2club.jar graph.dimacs -vb -t 4 -out robust