求解最大独立集问题的一种新的并行算法

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI:10.1137/0218029

M. Goldberg, T. Spencer

{"title":"求解最大独立集问题的一种新的并行算法","authors":"M. Goldberg, T. Spencer","doi":"10.1137/0218029","DOIUrl":null,"url":null,"abstract":"A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"121","resultStr":"{\"title\":\"A new parallel algorithm for the maximal independent set problem\",\"authors\":\"M. Goldberg, T. Spencer\",\"doi\":\"10.1137/0218029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.\",\"PeriodicalId\":153779,\"journal\":{\"name\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"volume\":\"201 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"121\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0218029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0218029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 121

摘要

构造了一种新的求解最大独立集问题的并行算法。当在线性数量的eew处理器上实现时，它的运行时间为0 (log4n)。这是MIS的第一个确定性算法，它的运行时间是多对数的，其处理器时间乘积是最优的，直到一个多对数因子。

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

查看原文本刊更多论文

A new parallel algorithm for the maximal independent set problem

A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.

求助全文

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

来源期刊

28th Annual Symposium on Foundations of Computer Science (sfcs 1987)

自引率

0.00%

发文量