graphclust
Hierarchical Graph Clustering for a Collection of Networks
Graph clustering using an agglomerative algorithm to maximize the integrated classification likelihood criterion and a mixture of stochastic block models. The method is described in the article "Model-based clustering of multiple networks with a hierarchical algorithm" by T. Rebafka (2022) <arXiv:2211.02314>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.3 |
rolling source/ R- | graphclust_1.3.tar.gz |
20.7 KiB |
1.3 |
rolling linux/jammy R-4.5 | graphclust_1.3.tar.gz |
113.3 KiB |
1.3 |
rolling linux/noble R-4.5 | graphclust_1.3.tar.gz |
113.2 KiB |
1.3 |
latest source/ R- | graphclust_1.3.tar.gz |
20.7 KiB |
1.3 |
latest linux/jammy R-4.5 | graphclust_1.3.tar.gz |
113.3 KiB |
1.3 |
latest linux/noble R-4.5 | graphclust_1.3.tar.gz |
113.2 KiB |
1.3 |
2026-04-23 source/ R- | graphclust_1.3.tar.gz |
20.7 KiB |
1.3 |
2026-04-09 windows/windows R-4.5 | graphclust_1.3.zip |
116.4 KiB |
1.3 |
2025-04-20 source/ R- | graphclust_1.3.tar.gz |
20.7 KiB |