Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
نویسندگان
چکیده
منابع مشابه
Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
Because of unpredictable, uncertain and time-varying nature of real networks it seems that stochastic graphs, in which weights associated to the edges are random variables, may be a better candidate as a graph model for real world networks. Once the graph model is chosen to be a stochastic graph, every feature of the graph such as path, clique, spanning tree and dominating set, to mention a few...
متن کاملDistributed Learning Automata based Algorithm for Solving Maximum Clique Problem in Stochastic Graphs
Many real world systems modeled as graph or networks, which the characteristics of interaction between vertices are stochastic and the probability distribution function of the vertex weight is unknown. Finding the maximum clique in a given graph is known as a NP-Hard problem, motivated by the social networks analysis. The maximum clique of an arbitrary graph G is the sub-graph C of G, Such that...
متن کاملFinding the maximum clique in massive graphs
1. ABSTRACT Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NPhard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in...
متن کاملFinding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets
Shortest path problem in stochastic graphs has been recently studied in the literature and a number of algorithms has been provided to find it using varieties of learning automata models. However, all these algorithms suffer from two common drawbacks: low speed and lack of a clear termination condition. In this paper, we propose a novel learning automata-based algorithm for this problem which c...
متن کاملUtilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs
Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
سال: 2015
ISSN: 0218-4885,1793-6411
DOI: 10.1142/s0218488515500014