Title :
On the collapse of graphs related to scale-free networks
Author :
Bing Yao ; Hongyu Wang ; Ming Yao ; Xiang´en Chen ; Chao Yang ; Xiaomin Zhang
Author_Institution :
Coll. of Math. & Stat., Northwest Normal Univ., Lanzhou, China
Abstract :
Connected Dominating Set Problem is a fundamental problem in connected facility location and studied intensively in computer science and operations research and it is also a central problem in wireless networking. Maximum Leaf Spanning Tree Problem (MLSTP) is related with investigating scale-free networks. We investigate the collapse of graphs since “robust yet fragile” is an important character of scale-free networks, and provide two algorithms to approximate MLSTP.
Keywords :
complex networks; network theory (graphs); trees (mathematics); MLSTP; computer science; connected dominating set problem; connected facility location; graph collapse; maximum leaf spanning tree problem; operations research; robust-yet-fragile; scale-free networks; wireless networking; Approximation algorithms; Bismuth; Clustering algorithms; Educational institutions; Proteins; Robustness; Vegetation;
Conference_Titel :
Information Science and Technology (ICIST), 2013 International Conference on
Conference_Location :
Yangzhou
Print_ISBN :
978-1-4673-5137-9
DOI :
10.1109/ICIST.2013.6747651
