Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
worst-case exponential
|
| gptkbp:doi |
10.1145/362342.362367
|
| gptkbp:field |
graph theory
|
| gptkbp:improves |
pivoting
degeneracy ordering |
| gptkbp:input |
gptkb:graph
|
| gptkbp:introduced |
gptkb:Joep_Kerbosch
gptkb:Coen_Bron |
| gptkbp:introducedIn |
1973
|
| gptkbp:output |
all maximal cliques
|
| gptkbp:publishedIn |
gptkb:Communications_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:clique_problem
gptkb:maximum_clique_problem maximal clique |
| gptkbp:solvedBy |
maximal clique enumeration
|
| gptkbp:bfsParent |
gptkb:Coenraad_Bron
gptkb:maximum_clique_problem |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bron–Kerbosch algorithm
|