This HTML5 document contains 58 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17https://github.com/darrenstrash/
dcthttp://purl.org/dc/terms/
n14https://github.com/atulsingh7890/Graph/blob/master/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12http://dbpedia.org/resource/File:
n11https://davidpynes.github.io/Tutorials/Graphs/Graph_03/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n23https://gist.github.com/abhin4v/
n24https://gitlab.com/Gluttton/
n6http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n22http://www.dfki.de/~neumann/ie-seminar/presentations/
n8http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
n20https://github.com/skilla/
n25http://www.dcs.gla.ac.uk/~pat/jchoco/clique/enumeration/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18https://web.archive.org/web/20131029201831/http:/www.kuchaev.com/files/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Bron–Kerbosch_algorithm
rdf:type
dbo:Software
rdfs:label
Bron–Kerbosch algorithm
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.
owl:sameAs
freebase:m.05h4g5w
dbp:wikiPageUsesTemplate
dbt:Refbegin dbt:Refend dbt:Math dbt:Citation dbt:Harvtxt dbt:Reflist
dct:subject
dbc:Articles_with_example_pseudocode dbc:Graph_algorithms
dbo:wikiPageExternalLink
n11: n14:Graph.cpp n17:quick-cliques n18:graph.py n20:maximal-cliques n22:finding_cliques.pdf n23:8304062 n24:BronKerbosch n25:report.pdf
dbo:thumbnail
n6:6n-graf.svg?width=300
foaf:depiction
n6:6n-graf.svg
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n8:Bron–Kerbosch_algorithm?oldid=1054949233&ns=0
dbo:wikiPageID
21480757
dbo:wikiPageLength
16088
dbo:wikiPageRevisionID
1054949233
dbo:wikiPageWikiLink
dbr:Graph_(discrete_mathematics) dbr:Empty_set dbr:Recursion dbr:Social_network dbr:Subset dbr:Joep_Kerbosch dbr:Enumeration_algorithm n12:6n-graf.svg dbr:Degeneracy_(graph_theory) dbr:Time_complexity dbr:Neighbourhood_(graph_theory) dbr:Computer_science dbc:Graph_algorithms dbr:Backtracking dbr:Clique_problem dbr:List_of_algorithms dbr:Degree_(graph_theory) dbr:Israel_Journal_of_Mathematics dbr:Clique_(graph_theory) dbr:Netherlands dbr:Power_of_three dbr:Coenraad_Bron dbr:Output-sensitive_algorithm dbc:Articles_with_example_pseudocode dbr:Computational_chemistry dbr:Complete_graph dbr:Dense_graph dbr:Glossary_of_graph_theory
dbo: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.
foaf:isPrimaryTopicOf
n8:Bron–Kerbosch_algorithm