Abstract
Maximal clique enumeration is a well-studied problem due to its many applications. We present a new algorithm for this problem that enumerates maximal cliques in a diverse ordering. The main idea behind our approach is to adapt the classic Bron-Kerbosch (BK) algorithm by, conceptually, jumping between different nodes in the execution tree. Special care is taken to ensure that (1) each maximal clique is created precisely once, (2) the theoretical runtime remains the same as in the BK algorithm and (3) memory requirements remain reasonable. Experimental results show that we indeed achieve our goals, and moreover, that the cliques are enumerated in a diverse order.
| Original language | English |
|---|---|
| Title of host publication | CIKM 2020 - Proceedings of the 29th ACM International Conference on Information and Knowledge Management |
| Publisher | Association for Computing Machinery |
| Pages | 3321-3324 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781450368599 |
| DOIs | |
| State | Published - 19 Oct 2020 |
| Event | 29th ACM International Conference on Information and Knowledge Management, CIKM 2020 - Virtual, Online, Ireland Duration: 19 Oct 2020 → 23 Oct 2020 |
Publication series
| Name | International Conference on Information and Knowledge Management, Proceedings |
|---|
Conference
| Conference | 29th ACM International Conference on Information and Knowledge Management, CIKM 2020 |
|---|---|
| Country/Territory | Ireland |
| City | Virtual, Online |
| Period | 19/10/20 → 23/10/20 |
Bibliographical note
Publisher Copyright:© 2020 ACM.
Keywords
- diversity
- enumeration
- maximal cliques