1CLIQUER(1) User Commands CLIQUER(1)
2
3
4
6 cliquer - Find cliques in arbitrary weighted graphs
7
9 cliquer [OPTION]... <DIMACS_FILE>
10
12 Cliquer is a set of C routines for finding cliques in an arbitrary
13 weighted graph. It uses an exact branch-and-bound algorithm developed
14 by Patric Östergård. It is designed with the aim of being efficient
15 while still being flexible and easy to use.
16
18 -h, --help
19 Print the help text.
20
21 -a, --all
22 Find all cliques.
23
24 -s, --single
25 Find a single clique (the default).
26
27 -w, --weight
28 Tell only maximum weight (no faster than -s).
29
30 -m N, --min N
31 Search for cliques with weight at least N. If N = 0, searches
32 for maximum weight clique (default).
33
34 -M N, --max N
35 Search for cliques with weight at most N. If N = 0, no limit is
36 imposed (default). Positive N is incompatible with --min 0
37 (--min 1 is assumed).
38
39 -x, --maximal
40 Require cliques to be maximal.
41
42 -u, --unweighted
43 Assume weight 1 for all vertices.
44
45 -0, --from-0
46 Number vertices from 0 to n-1 instead of 1 to n when writing.
47
48 -r F, --reorder F
49 Reorder with function F. The available functions are:
50
51 none No ordering (same order as in the file).
52
53 reverse
54 Reverse of the order in the file.
55
56 default
57 Either unweighted-coloring or weighted-coloring, depending on
58 weightedness.
59
60 unweighted-coloring
61 Coloring method efficient for unweighted graphs.
62
63 weighted-coloring
64 Coloring method efficient for weighted graphs.
65
66 degree Order by ascending degree.
67
68 random Random order.
69
70 -q, --quiet
71 Suppresses progress output. Specifying -q twice suppresses all
72 output except the actual result.
73
75 Cliquer was written by Sampo Niskanen <sampo.niskanen@iki.fi> and
76 Patric Östergård <patric.ostergard@tkk.fi>.
77
78
79
80Cliquer 1.21 CLIQUER(1)