Algorithms for Maximum Leaf Spanning Tress of Edge-Growing Network Models in Information System

2015 ◽  
Vol 775 ◽  
pp. 431-435
Author(s):  
Xiao Min Wang ◽  
Xi Yang Zhao ◽  
Bing Yao ◽  
Ming Yao ◽  
Xiang En Chen

For system modeling, simulation techniques and sensors networks the edge-growing network models with any connected initial network model are introduced in this paper. We design some algorithms for finding Maximum Leaf Spanning Trees (MLS-trees) of the models. Our algorithms can find the MLS-trees having scale-free behavior and short diameters. These algorithms are designed by techniques including big-degree-first level-searching and first-first level-searching in order to scan the desired spanning trees.

2014 ◽  
Vol 513-517 ◽  
pp. 2444-2448 ◽  
Author(s):  
Bing Yao ◽  
Ming Yao ◽  
Xiang En Chen ◽  
Xia Liu ◽  
Wan Jia Zhang

Understanding the topological structure of scale-free networks or small world networks is required and useful for investigation of complex networks. We will build up a class of edge-growing network models and provide an algorithm for finding spanning trees of edge-growing network models in this article.


2014 ◽  
Vol 644-650 ◽  
pp. 1805-1808 ◽  
Author(s):  
Xia Liu ◽  
Bing Yao ◽  
Wan Jia Zhang ◽  
Xiang En Chen ◽  
Xiao Min Zhang

Fractals in building network models are objects which appear similar (at least in some statistical sense) at every lengthscale. We focus on produce the rectangular growing network models by constructive operations based on fractals, and show the scale-free behaviors of our models. We, also, try to find those nodes like “hubs” in the models by spanning trees having maximal leaves.


2018 ◽  
Vol 32 (32) ◽  
pp. 1850359 ◽  
Author(s):  
Yilun Shang

The literature on growing network models, exemplified by the preferential attachment model and the copying model, has followed an exponential growth in the last few years. In many real-life scenarios, however, the adding of new nodes and edges is not an exogenous process, but involves inheritance and sharing of the local environment of the existing ones. In this paper, we develop a mathematical framework to analytically and numerically study the percolation properties of the random networks with proliferation. We compare random attack (RA) and localized attack (LA) on benchmark models, including Erdős–Rényi (ER) networks, random regular (RR) networks, and scale-free (SF) networks, with proliferation mechanism. Our results highlight the nonmonotonic connections with robustness and growth, and unravel an intriguing opposite effect for RA and LA. In particular, it is shown that unbalanced proliferation enhances robustness to RA while it mitigates robustness to LA, both independent of the network degree distribution.


Author(s):  
Fahrizal Surya Panuntun ◽  
Ahmad Subhan Yazid ◽  
Muhammad Mustakim

The need for information in life has transformed into basic needs. As an impact, this will cause problems when not handled properly. The Garuda Cooperative is one of the Employee Cooperatives in Sragen with complex managerial data but its management is still manual. To support its business process, a management information system is needed to handle data quickly and accurately. This study aims to develop a management information system for Garuda Cooperatives. The flow of research used is analysis, design, implementation, testing, and conclusion. System modeling uses the Unified Modeling Language (UML) in the form of a use case diagram and statechart diagram. The programming language used is Delphi with PostgreSQL as database management. The information system produced includes processing savings and loan business units, processing membership data and reports. The results of the system testing on 8 respondents showed that the system was running well to meet needs, had an attractive appearance, and was easy to use.


Sign in / Sign up

Export Citation Format

Share Document