Solver for Largest Complete Subgroup (All Nodes Connected)

Finds the largest complete subgraph (clique) in an undirected graph via approximation algorithms for the maximal clique problem.

Usage

MaxClique(
  arcSources,
  arcTargets,
  numNodes,
  algorithm = "GrossoLocatelliPullanMc"
)

Arguments

arcSources

Vector corresponding to the source nodes of a graph's edges

arcTargets

Vector corresponding to the destination nodes of a graph's edges

numNodes

The number of nodes in the graph

algorithm

Choices of algorithm include "GrossoLocatelliPullanMc". GrossoLocatelliPullanMc is the default.

Value

A named list containing two entries: 1) "size": the clique size, and 2) "members": the members of the clique.

Details

For details on LEMON's implementation, including differences between the algorithms, see https://lemon.cs.elte.hu/pub/doc/1.3.1/a00194.html.