关于与无标度网络相关的图的坍缩

2013 IEEE Third International Conference on Information Science and Technology (ICIST) Pub Date : 2013-03-23 DOI:10.1109/ICIST.2013.6747651

B. Yao, Hongyu Wang, Ming Yao, Xiangen Chen, Chao Yang, Xiao-Min Zhang

{"title":"关于与无标度网络相关的图的坍缩","authors":"B. Yao, Hongyu Wang, Ming Yao, Xiangen Chen, Chao Yang, Xiao-Min Zhang","doi":"10.1109/ICIST.2013.6747651","DOIUrl":null,"url":null,"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.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On the collapse of graphs related to scale-free networks\",\"authors\":\"B. Yao, Hongyu Wang, Ming Yao, Xiangen Chen, Chao Yang, Xiao-Min Zhang\",\"doi\":\"10.1109/ICIST.2013.6747651\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":415759,\"journal\":{\"name\":\"2013 IEEE Third International Conference on Information Science and Technology (ICIST)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Third International Conference on Information Science and Technology (ICIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST.2013.6747651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST.2013.6747651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

连通支配集问题是互联设施选址中的一个基本问题，是计算机科学和运筹学研究的热点问题，也是无线网络中的一个核心问题。最大叶生成树问题(MLSTP)是一个研究无标度网络的问题。由于“鲁棒而脆弱”是无标度网络的一个重要特征，我们研究了图的崩溃，并提供了两种近似MLSTP的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the collapse of graphs related to scale-free networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 IEEE Third International Conference on Information Science and Technology (ICIST)

自引率

0.00%

发文量