Solving Maximum Clique Problem in Stochastic Graphs Using Learning Automata

被引：0
|
作者：
Soleimani-Pouri, Mohammad [1 ]
Rezvanian, Alireza [2 ]
Meybodi, Mohammad Reza [2 ]
机构：
[1] Islamic Azad Univ, Dept Elect Comp & Biomed Engn, Qazvin, Iran
[2] Amirkabir Univ Technol, Comp Engn & Informat Technol Dept, Tehran, Iran
来源：
2012 FOURTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL ASPECTS OF SOCIAL NETWORKS (CASON) | 2012年
关键词：
maximum clique problem; NP-Hard; stochastic graph; learning automata; social networks; ALGORITHMS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：115 / 119
页数：5
相关论文
共 50 条
12345