Finding minimum weight connected dominating set in stochastic graph based on learning automata

DOI10.1016/j.ins.2012.02.057zbMath1248.05131MaRDI QIDQ712488

D. Kharzeev

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

zbMATH Keywords

learning automata; dominating set; minimum connected dominating set; stochastic graph

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68Q45: Formal languages and automata

90C59: Approximation methods and heuristics in mathematical programming

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)