{"title":"One Class of Clusterization Problems in Network Models","authors":"E. Gimadi, Danila Chesnokov, E. Shin","doi":"10.1109/OPCS.2019.8880249","DOIUrl":null,"url":null,"abstract":"One clustering problem, which arises in design of search systems, is considered. NP-hardness of the general case of the problem is proved. A complexity status is determined for the cases with certain particular structures of the directed graph, such as: Complete Acyclic graph, Path graph, OutTree and InTree graphs. For the cases of Path and InTree graphs the exact algorithms with quadratic complexity are proposed.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
One clustering problem, which arises in design of search systems, is considered. NP-hardness of the general case of the problem is proved. A complexity status is determined for the cases with certain particular structures of the directed graph, such as: Complete Acyclic graph, Path graph, OutTree and InTree graphs. For the cases of Path and InTree graphs the exact algorithms with quadratic complexity are proposed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
