On Generating Random Network Structures: Connected Graphs
On Generating Random Network Structures: Connected Graphs
复制标题
关于生成随机网络结构：连通图
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Hyunseung Choo
中科院分区：
文献类型：
--
作者：
A. Rodionov;Hyunseung Choo
在本文中，我们提出了一套基本算法生成连通随机图（RG）。RG可用于测试网络上的不同算法。本文给出了在有限节点度、给定节点度、不同边存在概率等条件下随机生成连通图、子图（节点完备集上的子图）等的快速算法，并证明了算法的性质，特别注意生成“类似于真实的网络”的图.算法以类Pascal伪代码的形式给出。
In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast algorithms with proved properties are presented for random generation of connected graphs, sugraphs (subgraphs on the complete set of nodes) and others in conditions of given restrictions, such as limited node degree, given node degrees, different probabilities of edges existence etc. Special attention is given to generating graphs “similar to real networks.” The algorithms are presented in the Pascal-like pseudo code.