Brahim Neggazi, V. Turau, Mohammed Haddad, H. Kheddouci
{"title":"A O(m) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs","authors":"Brahim Neggazi, V. Turau, Mohammed Haddad, H. Kheddouci","doi":"10.1142/S0129626417500049","DOIUrl":null,"url":null,"abstract":"The triangle partition problem is a generalization of the well-known graph matching problem consisting of finding the maximum number of independent edges in a given graph, i.e., edges with no commo...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129626417500049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The triangle partition problem is a generalization of the well-known graph matching problem consisting of finding the maximum number of independent edges in a given graph, i.e., edges with no commo...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
