The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929239295524864 |
|---|---|
| author | Manoussakis, George |
| author_facet | Manoussakis, George |
| contents | The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash in "Listing all maximal cliques in sparse graphs in near-optimal time. International Symposium on Algorithms and Computation. Springer, Berlin, Heidelberg, 2010" is output sensitive. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1911_01951 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive Manoussakis, George Data Structures and Algorithms The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash in "Listing all maximal cliques in sparse graphs in near-optimal time. International Symposium on Algorithms and Computation. Springer, Berlin, Heidelberg, 2010" is output sensitive. |
| title | The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/1911.01951 |