The dataset contains the benchmark graphs which analyzed for the paper. Each compressed file starting with the name "iteration k" is consisting 375 graphs. These graphs are generated by using a growin
This dataset consists of 25-45 node graphs generated via BA [1] with uniformly randomly scattered nodes over a grid the size of north america with a minimim of 100km between...
and are the number of nodes and links, and are the maximum of in-degree and out-degree of all nodes, and is the average degree of all nodes (average in-degree equals average out-degree). and are the 9
本数据集为论文“Scaling up real networks by geometric branching growth”的配套数据，包含JCN和WTW两种真实网络的边列表与双曲图数据，用于支持复杂网络几何分支增长扩展方法的研究，仅含一个压缩文件。 论文“Scaling up real networks by geometric branching growth”（Proc. Natl. Ac
N, L and Nc denote the number of nodes, edges and connected components, respectively; LCC stands for Largest Connected Component; 〈k〉 is the average degree of the network; the fill is defined as the r
