{"title":"树中b匹配的最优并行算法","authors":"Constantine N. K. Osiakwan, S. Akl","doi":"10.1007/3-540-51859-2_22","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":321589,"journal":{"name":"Optimal Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Optimal Parallel Algorithms for b-Matchings in Trees\",\"authors\":\"Constantine N. K. Osiakwan, S. Akl\",\"doi\":\"10.1007/3-540-51859-2_22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":321589,\"journal\":{\"name\":\"Optimal Algorithms\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimal Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-51859-2_22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimal Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-51859-2_22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}