Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata

DOI10.1142/S0218488515500014zbMath1323.05113OpenAlexW2063745753MaRDI QIDQ3448629

No author found.

Publication date: 26 October 2015

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218488515500014

zbMATH Keywords

social networksmaximum cliqueclique problemdistributed learning automatastochastic graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Formal languages and automata (68Q45) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Related Items (3)

Efficient pattern matching on big uncertain graphs ⋮ An Introduction to Learning Automata and Optimization ⋮ Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization

Cites Work

• Breakout local search for maximum clique problems
• An adaptive multistart tabu search approach to solve the maximum clique problem
• Grid resource discovery based on distributed learning automata
• Clustering the wireless ad hoc networks: a distributed learning automata approach
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• Minimum spanning trees in networks with varying edge weights
• An effective local search for the maximum clique problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• A simple simulated annealing algorithm for the maximum clique problem
• A study of ACO capabilities for solving the maximum clique problem
• Bistable stochastic biochemical networks: large chemical networks and systems with many molecules
• A review on algorithms for maximum clique problems
• A Complementary Pivoting Approach to the Maximum Weight Clique Problem
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
• LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS
• A clique-based algorithm for constructing feasible timetables
• Emergence of Scaling in Random Networks
• STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• Learning Optimal Discriminant Functions through a Cooperative Game of Automata
• Bounds on the Convergence Probabilities of Learning Automata
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Collective dynamics of ‘small-world’ networks
• Reactive local search for the maximum clique problem

This page was built for publication: Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata