圆弧图最大独立集的并行算法

Proceedings IEEE Southeastcon '92 Pub Date : 1992-04-12 DOI:10.1109/SECON.1992.202301

A. Sprague

{"title":"圆弧图最大独立集的并行算法","authors":"A. Sprague","doi":"10.1109/SECON.1992.202301","DOIUrl":null,"url":null,"abstract":"The author presents a parallel algorithm of cost O(n log n) to find a maximum independent set of a circular arc graph. In the CREW PRAM model the algorithm takes O(log n) time, while in the EREW PRAM model it requires O(log/sup 2/ n) time. It illustrates the use of divide-and-conquer in parallel algorithms. The heart of the algorithm solves this problem on an interval graph, which is derived from the given circular arc graph. Postprocessing selects a maximum independent set on the given circular arc graph.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A parallel algorithm for maximum independent set of a circular-arc graph\",\"authors\":\"A. Sprague\",\"doi\":\"10.1109/SECON.1992.202301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author presents a parallel algorithm of cost O(n log n) to find a maximum independent set of a circular arc graph. In the CREW PRAM model the algorithm takes O(log n) time, while in the EREW PRAM model it requires O(log/sup 2/ n) time. It illustrates the use of divide-and-conquer in parallel algorithms. The heart of the algorithm solves this problem on an interval graph, which is derived from the given circular arc graph. Postprocessing selects a maximum independent set on the given circular arc graph.<<ETX>>\",\"PeriodicalId\":230446,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon '92\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1992.202301\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Southeastcon '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1992.202301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种求圆弧图最大独立集的并行算法，其代价为0 (n log n)。在CREW PRAM模型中，算法耗时为O(log n)，而在EREW PRAM模型中，耗时为O(log/sup 2/ n)。它说明了并行算法中分治法的使用。该算法的核心是在一个区间图上解决这个问题，该区间图是由给定的圆弧图导出的。后处理在给定的圆弧图上选择一个最大独立集

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

查看原文本刊更多论文

A parallel algorithm for maximum independent set of a circular-arc graph

The author presents a parallel algorithm of cost O(n log n) to find a maximum independent set of a circular arc graph. In the CREW PRAM model the algorithm takes O(log n) time, while in the EREW PRAM model it requires O(log/sup 2/ n) time. It illustrates the use of divide-and-conquer in parallel algorithms. The heart of the algorithm solves this problem on an interval graph, which is derived from the given circular arc graph. Postprocessing selects a maximum independent set on the given circular arc graph.<>

求助全文

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

来源期刊

Proceedings IEEE Southeastcon '92

自引率

0.00%

发文量