About: Bron–Kerbosch algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Bron–Kerbosch algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

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 , who published its description in 1973.

Attributes	Values
rdf:type	software
rdfs:label	Bron–Kerbosch algorithm (en)
rdfs:comment	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 , who published its description in 1973. (en)
sameAs	Bron–Kerbosch algorithm
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Harvtxt dbt:Math dbt:Refbegin dbt:Refend dbt:Reflist
Subject	Articles with example pseudocode Graph algorithms
Link from a Wikipage to an external page	https://github.com/atulsingh7890/Graph/blob/master/Graph.cpp https://github.com/darrenstrash/quick-cliques https://github.com/skilla/maximal-cliques https://web.archive.org/web/20131029201831/http:/www.kuchaev.com/files/graph.py http://www.dfki.de/~neumann/ie-seminar/presentations/finding_cliques.pdf https://davidpynes.github.io/Tutorials/Graphs/Graph_03/ https://gist.github.com/abhin4v/8304062 http://www.dcs.gla.ac.uk/~pat/jchoco/clique/enumeration/report.pdf https://gitlab.com/Gluttton/BronKerbosch
thumbnail	wiki-commons:Special:FilePath/6n-graf.svg?width=300
foaf:depiction
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Bron–Kerbosch_algorithm?oldid=1054949233&ns=0
Wikipage page ID	21480757 (xsd:integer)
page length (characters) of wiki page	16088 (xsd:nonNegativeInteger)
Wikipage revision ID	1054949233 (xsd:integer)
Link from a Wikipage to another Wikipage	Backtracking Output-sensitive algorithm Articles with example pseudocode Glossary of graph theory Graph algorithms Power of three Degeneracy (graph theory) Degree (graph theory) Dense graph Time complexity Clique (graph theory) Clique problem Coenraad Bron Complete graph Computational chemistry Computer science List of algorithms Social network Empty set Enumeration algorithm Graph Subset Israel Journal of Mathematics Neighbourhood (graph theory) Netherlands Recursion dbr:Joep_Kerbosch
has abstract	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 , who published its description in 1973. Although other algorithms for solving the clique problem have running times that are, in theory, better on inputs that have few maximal independent sets, the Bron–Kerbosch algorithm and subsequent improvements to it are frequently reported as being more efficient in practice than the alternatives. It is well-known and widely used in application areas of graph algorithms such as computational chemistry. A contemporaneous algorithm of , although presented in different terms, can be viewed as being the same as the Bron–Kerbosch algorithm, as it generates the same search tree. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Bron–Kerbosch_algorithm
is Wikipage redirect of	Bron-Kerbosch algorithm
is Link from a Wikipage to another Wikipage of	Bron-Kerbosch algorithm Clique (graph theory) Clique problem Coenraad Bron Community structure List of algorithms Enumeration algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Bron–Kerbosch_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software