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.
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Nature Portfolio
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/a19e07e56ad248be8a1a4ba95a9bda87 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!