Jonathan Aronson, A. Frieze, B. Pittel
{"title":"稀疏随机图中的最大匹配:Karp-Sipser重访","authors":"Jonathan Aronson, A. Frieze, B. Pittel","doi":"10.1002/(SICI)1098-2418(199803)12:2%3C111::AID-RSA1%3E3.0.CO;2-%23","DOIUrl":null,"url":null,"abstract":"We study the average performance of a simple greedy algorithm for finding a matching in a sparse random graph Gn, c/n, where c>0 is constant. The algorithm was first proposed by Karp and Sipser [Proceedings of the Twenty-Second Annual IEEE Symposium on Foundations of Computing, 1981, pp. 364–375]. We give significantly improved estimates of the errors made by the algorithm. For the subcritical case where c e then with high probability the algorithm produces a matching which is within n1/5+o(1) of maximum size. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 111–177, 1998","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"130","resultStr":"{\"title\":\"Maximum matchings in sparse random graphs: Karp-Sipser revisited\",\"authors\":\"Jonathan Aronson, A. Frieze, B. Pittel\",\"doi\":\"10.1002/(SICI)1098-2418(199803)12:2%3C111::AID-RSA1%3E3.0.CO;2-%23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the average performance of a simple greedy algorithm for finding a matching in a sparse random graph Gn, c/n, where c>0 is constant. The algorithm was first proposed by Karp and Sipser [Proceedings of the Twenty-Second Annual IEEE Symposium on Foundations of Computing, 1981, pp. 364–375]. We give significantly improved estimates of the errors made by the algorithm. For the subcritical case where c e then with high probability the algorithm produces a matching which is within n1/5+o(1) of maximum size. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 111–177, 1998\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"130\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199803)12:2%3C111::AID-RSA1%3E3.0.CO;2-%23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199803)12:2%3C111::AID-RSA1%3E3.0.CO;2-%23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 130
Maximum matchings in sparse random graphs: Karp-Sipser revisited
We study the average performance of a simple greedy algorithm for finding a matching in a sparse random graph Gn, c/n, where c>0 is constant. The algorithm was first proposed by Karp and Sipser [Proceedings of the Twenty-Second Annual IEEE Symposium on Foundations of Computing, 1981, pp. 364–375]. We give significantly improved estimates of the errors made by the algorithm. For the subcritical case where c e then with high probability the algorithm produces a matching which is within n1/5+o(1) of maximum size. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 111–177, 1998
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
