一种快速识别最小支配集的近似方法

2014 IEEE 5th International Conference on Software Engineering and Service Science Pub Date : 2014-06-27 DOI:10.1109/ICSESS.2014.6933601

You Zhou, Guodong Lv, Baoxin Xiu, Weiming Zhang, Qing Cheng

{"title":"一种快速识别最小支配集的近似方法","authors":"You Zhou, Guodong Lv, Baoxin Xiu, Weiming Zhang, Qing Cheng","doi":"10.1109/ICSESS.2014.6933601","DOIUrl":null,"url":null,"abstract":"The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programming phases are shown in detail.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"284 1","pages":"443-448"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A faster approximate method to identify minimum dominating set\",\"authors\":\"You Zhou, Guodong Lv, Baoxin Xiu, Weiming Zhang, Qing Cheng\",\"doi\":\"10.1109/ICSESS.2014.6933601\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programming phases are shown in detail.\",\"PeriodicalId\":6473,\"journal\":{\"name\":\"2014 IEEE 5th International Conference on Software Engineering and Service Science\",\"volume\":\"284 1\",\"pages\":\"443-448\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 5th International Conference on Software Engineering and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2014.6933601\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 5th International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2014.6933601","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

最小支配集(MDS)问题被认为是np困难问题。目前最快的n个顶点图的MDS问题提取算法耗时O(20.59n)，只能在8小时内解决200个顶点规模的MDS问题，相比之下，本文提出了一种更快的近似分层方法，可以在O(n2)时间内解决MDS问题，并证明该方法特别适用于更大规模的MDS。在此基础上，详细介绍了程序设计的各个阶段。

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

查看原文本刊更多论文

A faster approximate method to identify minimum dominating set

The minimum dominating set (MDS) problem is known to be NP-hard. Compared with the currently fastest extract algorithm for MDS problem on graphs of n vertices using O(20.59n)time, which could merely tackle these problems with 200 vertices scale in 8 hours, the paper presents a faster approximate layer-method to address MDS problems in O(n2) time and the method is proved to be effective particularly for larger scale MDS. Furthermore, the programming phases are shown in detail.

求助全文

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

来源期刊

2014 IEEE 5th International Conference on Software Engineering and Service Science

自引率

0.00%

发文量