Finding minimum weight connected dominating set in stochastic graph based on learning automata
DOI10.1016/J.INS.2012.02.057zbMATH Open1248.05131OpenAlexW2134648356MaRDI QIDQ712488FDOQ712488
Publication date: 17 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.057
Recommendations
- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- Algorithms for Steiner connected dominating set problem based on learning automata theory
- A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
- Stochastic bounded diameter minimum spanning tree problem
- Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
Formal languages and automata (68Q45) Approximation methods and heuristics in mathematical programming (90C59) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Unit disk graphs
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Dominating sets in directed graphs
- Approximation algorithms for connected dominating sets
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- Simple heuristics for unit disk graphs
- A linear kernel for a planar connected dominating set
- Efficient algorithms for the minimum connected domination on trapezoid graphs
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- Bounds on the Convergence Probabilities of Learning Automata
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
- Minimum spanning trees in networks with varying edge weights
Cited In (7)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- Link prediction based on temporal similarity metrics using continuous action set learning automata
- An optimal time algorithm for minimum linear arrangement of chord graphs
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search
- Dominating problems in swapped networks
This page was built for publication: Finding minimum weight connected dominating set in stochastic graph based on learning automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712488)
