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 条

[31] An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs
Jiang, Hua
Li, Chu-Min
Manya, Felip
THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 830 - 838
[32] The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
Francis, Mathew C.
Goncalves, Daniel
Ochem, Pascal
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 57 - 68
[33] ON GRAPHS WITH POLYNOMIALLY SOLVABLE MAXIMUM-WEIGHT CLIQUE PROBLEM
BALAS, E
YU, CS
NETWORKS, 1989, 19 (02) : 247 - 253
[34] An Efficient Local Search for the Maximum Clique Problem on Massive Graphs
Kanahara, Kazuho
Oda, Tetsuya
Kulla, Elis
Uejima, Akira
Katayama, Kengo
ADVANCES IN INTERNET, DATA & WEB TECHNOLOGIES (EIDWT-2022), 2022, 118 : 201 - 211
[35] A CLP Approach for Solving the Maximum Clique Problem: Benefits and Limits
Badica, Amelia
badica, Costin
Ivanovic, Mirjana
Logofatu, Doina
2017 21ST INTERNATIONAL CONFERENCE ON SYSTEM THEORY, CONTROL AND COMPUTING (ICSTCC), 2017, : 613 - 617
[36] MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
Guo, Ping
Wang, Xuekun
Zeng, Yi
Chen, Haizhu
IEEE ACCESS, 2019, 7 : 108360 - 108370
[37] Solving Maximum Clique Problem using a Novel Quantum-inspired Evolutionary Algorithm
Das, Pronaya Prosun
Khan, Mozammel H. A.
2ND INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATION COMMUNICATION TECHNOLOGY (ICEEICT 2015), 2015,
[38] An improved maximum neural network with stochastic dynamics characteristic for maximum clique problem
Faculty of Engineering, Toyama University, Japan
IEEJ Trans. Electron. Inf. Syst., 2008, 1 (11+94-100):
[39] On solving the capacity assignment problem using continuous learning automata
Oommen, BJ
Roberts, TD
MULTIPLE APPROACHES TO INTELLIGENT SYSTEMS, PROCEEDINGS, 1999, 1611 : 622 - 631
[40] Maximum clique problem
1600, (04):

← 1 2 3 4 5 →