{'fraction_non_alphanumeric': 0.028052805280528052, 'fraction_numerical': 0.0, 'mean_word_length': 5.257731958762887, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algorithms for Maximum Leaf Spanning Tress of Edge-Growing Network Models in Information System

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.