LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS

DOI10.1142/S0218488510006775zbMath1210.68063OpenAlexW2021611971MaRDI QIDQ3070074

No author found.

Publication date: 2 February 2011

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/s0218488510006775

zbMATH Keywords

learning automatadominating setweakly connected dominating setdistributed learning automatastochastic graph

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Link prediction based on temporal similarity metrics using continuous action set learning automata ⋮ Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ An Introduction to Learning Automata and Optimization

Cites Work

• Clustering the wireless ad hoc networks: a distributed learning automata approach
• Clustering wireless ad hoc networks with weakly connected dominating set
• An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
• Unit disk graphs
• On weakly connected domination in graphs
• Approximation algorithms for connected dominating sets
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information: A Unified Approach
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Simple heuristics for unit disk graphs
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
• A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS

This page was built for publication: LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS