Mohammad Soleimani-Pouri, Alireza Rezvanian, M. Meybodi
{"title":"Solving maximum clique problem in stochastic graphs using learning automata","authors":"Mohammad Soleimani-Pouri, Alireza Rezvanian, M. Meybodi","doi":"10.1109/CASoN.2012.6412388","DOIUrl":null,"url":null,"abstract":"The maximum clique of a given graph G is the subgraph C of G such that two vertices in C are adjacent in G with maximum cardinality. Finding the maximum clique in an arbitrary graph is an NP-Hard problem, motivated by the social networks analysis. In the real world applications, the nature of interaction between nodes is stochastic and the probability distribution function of the vertex weight is unknown. In this paper a learning automata-based algorithm is proposed for solving maximum clique problem in the stochastic graph. The simulation results on stochastic graph demonstrate that the proposed algorithm outperforms standard sampling method in terms of the number of samplings taken by algorithm.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASoN.2012.6412388","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
The maximum clique of a given graph G is the subgraph C of G such that two vertices in C are adjacent in G with maximum cardinality. Finding the maximum clique in an arbitrary graph is an NP-Hard problem, motivated by the social networks analysis. In the real world applications, the nature of interaction between nodes is stochastic and the probability distribution function of the vertex weight is unknown. In this paper a learning automata-based algorithm is proposed for solving maximum clique problem in the stochastic graph. The simulation results on stochastic graph demonstrate that the proposed algorithm outperforms standard sampling method in terms of the number of samplings taken by algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
