Bron–Kerbosch algorithm
id:
bron-kerbosch-algorithm-259-1402973
title:
Bron–Kerbosch algorithm
text:
In computer science, the Bron–Kerbosch algorithm is an enumeration algorithm for finding all maximal cliques in an undirected graph. That is, it lists all subsets of vertices with the two properties that each pair of vertices in one of the listed subsets is connected by an edge, and no listed subset can have any additional vertices added to it while preserving its complete connectivity. The Bron–Kerbosch algorithm was designed by Dutch scientists Coenraad Bron and Joep Kerbosch, who published it
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm
date created:
date modified:
2024-02-23T19:08:30Z
main entity:
{"identifier":"Q2031707","url":"https://www.wikidata.org/entity/Q2031707"}
image:
fields total:
13
integrity:
13