Pages that link to "Item:Q989481"
From MaRDI portal
The following pages link to A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481):
Displaying 11 items.
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components (Q1293460) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142) (← links)
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950) (← links)
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model (Q2460592) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets (Q5261609) (← links)
- Brief announcement: Fully lattice linear algorithms (Q6155259) (← links)
