遇见数据集

Dataset for paper Computing well-balanced spanning trees of unweighted networks

收藏
Zenodo2025-03-16 更新2026-05-26 收录
官方服务:

资源简介:

The dataset includes synthetic graphs and real networks in Pajek format, which are used in the paper "Computing well-balanced spanning trees of unweighted networks." References to the original repositories of real networks are available within the paper. graphs/lattice_[n].net: Triangular lattices with n nodes. graphs/random_[n]_#.net: 100 Erdos-Renyi random graphs with n nodes and an average degree of 10. graphs/scalefree_[n]_#.net: 100 Barabasi-Albert scale-free graphs with n nodes and an average degree of 10. networks/as_[date].net: 733 autonomous systems graphs extracted by the Oregon Route Views project to date. networks/facebook_#.net: 97 Facebook friendship networks of students at different US universities. networks/mathoverflow_#.net: 75 networks of interactions between the users at the stack exchange website MathOverflow. networks/physreve_[vol].net: 46 citation networks of papers published in the journal Physical Review E up to the volume vol. networks/ppi_[species].net: 40 protein-protein interaction networks of different species collected from the BioGRID repository. networks/sicris_[year].net: 25 author collaboration networks of Slovenian researchers extracted from the SICRIS database to year.

提供机构:
Zenodo
创建时间:
2025-03-16
二维码
社区交流群
二维码
科研交流群
商业服务