Local Community Detection in Complex Networks Based on Maximum Cliques Extension

Algorithm 2

Bron-Kerbosch.

Input: 𝑅, 𝑃, 𝑋, MCS

Output: MCS

Begin:

(1) if  𝑃=∅ and 𝑋=∅

(2)    MCS←MCS∪𝑅;

(3) else

(4)    𝑢← a pivot node in 𝑃∪𝑋

(5)    foreach  𝑣 in 𝑃⧵{𝑢}

(6)    BronKerbosch (𝑅∪{𝑣}, 𝑃∩𝑁(𝑣), 𝑋∩𝑁(𝑣), MCS);

(7)    𝑃←𝑃⧵{𝑣};

(8)    𝑋←𝑋∪{𝑣};

(9)   endfor

(10) endif

(11) retrun  MCS

End