Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2012.02.057 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134648356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5766611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees in networks with varying edge weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Convergence Probabilities of Learning Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly connected dominating sets in asymmetric multihop wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear kernel for a planar connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the minimum connected domination on trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for constructing weakly connected minimal dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs / rank
 
Normal rank

Latest revision as of 19:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Finding minimum weight connected dominating set in stochastic graph based on learning automata
scientific article

    Statements

    Finding minimum weight connected dominating set in stochastic graph based on learning automata (English)
    0 references
    0 references
    17 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dominating set
    0 references
    minimum connected dominating set
    0 references
    stochastic graph
    0 references
    learning automata
    0 references
    0 references