{"title":"An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*","authors":"Zoltán Tasnádi, Noémi Gaskó","doi":"10.1109/SYNASC57785.2022.00039","DOIUrl":null,"url":null,"abstract":"The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"191 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. Numerical experiments show the effectiveness and potential of the proposed approach.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
