Bron–Kerbosch algorithm
a recursive backtracking algorithm for finding maximal cliques in an undirected graph
Press Enter · cited answer in seconds
0 sources
Bron–Kerbosch algorithm
Summary
Bron–Kerbosch algorithm is an algorithm[1]. It draws 36 Wikipedia views per month (algorithm category, ranking #117 of 337).[2]
Key Facts
- Bron–Kerbosch algorithm's instance of is recorded as algorithm[3].
- Bron–Kerbosch algorithm's instance of is recorded as graph algorithm[4].
- Coenraad Bron is named after Bron–Kerbosch algorithm[5].
- Bron–Kerbosch algorithm's Freebase ID is recorded as /m/05h4g5w[6].
- Bron–Kerbosch algorithm's MathWorld ID is recorded as Bron-KerboschAlgorithm[7].
- Bron–Kerbosch algorithm's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- Bron–Kerbosch algorithm's Microsoft Academic ID is recorded as 2781472471[9].
Body
Designation and Status
Recorded instance of include algorithm[3] and graph algorithm[4].
History and Context
Coenraad Bron is named after Bron–Kerbosch algorithm[5].
Why It Matters
Bron–Kerbosch algorithm draws 36 Wikipedia views per month (algorithm category, ranking #117 of 337).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[10]