应用 TFLS 算法寻找 SBEGN 模型具最多叶子生成树

摘要

用动态网络模型来逼近和模拟现实网络是研究网络的重要手段之一，从构造单边界增长网络模型入手，验证该模型具有增长性、层次性。设计了时间优先层次搜索算法，利用该算法来寻找单边界增长网络模型具有最多叶子的生成树，并证明了所找到的具有最多叶子生成树具有无标度性这一重要的网络拓扑结构。%Applying dynamic network model to approximate and simulate real network is an important technique in networks research.The so-called single bound edge-growing network models (SBEGN models)are constructed,and some properties of the SBEGN models are validated,such as their growth properties, intrinsic hierarchy. An algorithm called the time-first level-searching algorithm (TFLS algorithm)is designed for finding these spanning trees with maximal leaves from the SBEGN models;and it is testified that the network topology of these particular classes of spanning trees is the scale-free architecture.