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.
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/a19e07e56ad248be8a1a4ba95a9bda87 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|