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

Abstract

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.