Bron-Kerbosch algorithm

Table of Contents

_20240308_113502screenshot.png

Intuition

R is the current confirmed maximal clique P is prospective points that may become part of the clique, and will be tested in the following recusion’s for loop X is node that are possible to be encountered and marked not possible to be in the maximal clique

The algorithm

Backlinks

maximal clique listing

finding the maximal clique with algorithm

algorithmic way of creating list of all in a network

Author: Linfeng He

Created: 2024-04-03 Wed 20:59