NAME

cliquer - Find cliques in arbitrary weighted graphs

SYNOPSIS

cliquer [OPTION]... <DIMACS_FILE>

DESCRIPTION

Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm developed by Patric Östergård. It is designed with the aim of being efficient while still being flexible and easy to use.

OPTIONS

-h, --help

Print the help text.

-a, --all

Find all cliques.

-s, --single

Find a single clique (the default).

-w, --weight

Tell only maximum weight (no faster than -s).

-m N, --min N

Search for cliques with weight at least N. If N = 0, searches for maximum weight clique (default).

-M N, --max N

Search for cliques with weight at most N. If N = 0, no limit is imposed (default). Positive N is incompatible with --min 0 (--min 1 is assumed).

-x, --maximal

Require cliques to be maximal.

-u, --unweighted

Assume weight 1 for all vertices.

-0, --from-0

Number vertices from 0 to n-1 instead of 1 to n when writing.

-r F, --reorder F

Reorder with function F. The available functions are:

none

No ordering (same order as in the file).

reverse

Reverse of the order in the file.

default

Either unweighted-coloring or weighted-coloring, depending on weightedness.

unweighted-coloring

Coloring method efficient for unweighted graphs.

weighted-coloring

Coloring method efficient for weighted graphs.

degree

Order by ascending degree.

random

Random order.

-q, --quiet

Suppresses progress output. Specifying -q twice suppresses all output except the actual result.

AUTHORS

Cliquer was written by Sampo Niskanen <sampo.niskanen@iki.fi> and Patric Östergård <patric.ostergard@tkk.fi>.