NeAT
- graph-cliques
Extract all maximal cliques from a graph. It is based on a reimplementation of the
Bron-Kerbosch algorithm (1973)
by
Johnston (1975)
This program was developed by
Sylvain Brohée
and
Jacques van Helden
.
Input format
tab-delimited format
Adjacency matrix
GML format
Graph
Upload graph from file :
Column specification (only relevant for tab-delimited input)
Source node
Target node
Minimum size of the cliques
RESET
DEMO
MANUAL
TUTORIAL
MAIL