Computing cliques and cavities in networks
The study of high-order networks as attracted significant attention recently. The authors introduce the concept of computability for searching maximum clique in large networks and an optimized algorithm for finding cavities with different orders.
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Nature Portfolio
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/a19e07e56ad248be8a1a4ba95a9bda87 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | The study of high-order networks as attracted significant attention recently. The authors introduce the concept of computability for searching maximum clique in large networks and an optimized algorithm for finding cavities with different orders. |
|---|