{"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}
引用次数: 0
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
