{"title":"O (log4n)时间并行最大匹配算法使用线性数量的处理器","authors":"Alak Kumar Datta, Ranjan Kumar Sen†","doi":"10.1080/1063719042000208827","DOIUrl":null,"url":null,"abstract":"Computing maximal matching of a graph having n vertices in parallel within time using a linear number of processors on the EREW-PRAM is an open problem [Karp, R.M. and Ramachandran, V. (1990) “Parallel algorithms for shared-memory machines”, In: van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Vol. A, pp 869–941]. In this paper, we resolve this by presenting a parallel algorithm on the EREW-PRAM that works in time using O(n) number of processors, where Δ(G) is the degree of the graph.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"o(log4 n) time parallel maximal matching algorithm using linear number of processors\",\"authors\":\"Alak Kumar Datta, Ranjan Kumar Sen†\",\"doi\":\"10.1080/1063719042000208827\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computing maximal matching of a graph having n vertices in parallel within time using a linear number of processors on the EREW-PRAM is an open problem [Karp, R.M. and Ramachandran, V. (1990) “Parallel algorithms for shared-memory machines”, In: van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Vol. A, pp 869–941]. In this paper, we resolve this by presenting a parallel algorithm on the EREW-PRAM that works in time using O(n) number of processors, where Δ(G) is the degree of the graph.\",\"PeriodicalId\":406098,\"journal\":{\"name\":\"Parallel Algorithms and Applications\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/1063719042000208827\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/1063719042000208827","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
在EREW-PRAM上使用线性数量的处理器计算具有n个并行顶点的图在时间内的最大匹配是一个开放问题[Karp, R.M.和Ramachandran, V.(1990)，“共享内存机器的并行算法”，in: van Leeuwen, J.， ed.， Handbook of Theoretical Computer Science, Vol. a, pp 869-941]。在本文中，我们通过在EREW-PRAM上提出一种并行算法来解决这个问题，该算法使用O(n)个处理器及时工作，其中Δ(G)是图的度。
o(log4 n) time parallel maximal matching algorithm using linear number of processors
Computing maximal matching of a graph having n vertices in parallel within time using a linear number of processors on the EREW-PRAM is an open problem [Karp, R.M. and Ramachandran, V. (1990) “Parallel algorithms for shared-memory machines”, In: van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Vol. A, pp 869–941]. In this paper, we resolve this by presenting a parallel algorithm on the EREW-PRAM that works in time using O(n) number of processors, where Δ(G) is the degree of the graph.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
