Pages that link to "Item:Q2446589"

The following pages link to Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589):

Displaying 16 items.

• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
• A self-stabilizing algorithm for optimally efficient sets in graphs (Q456061) (← links)
• A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
• A self-stabilizing algorithm for edge monitoring in wireless sensor networks (Q528199) (← links)
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
• A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction (Q2015150) (← links)
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950) (← links)
• Self-stabilizing algorithm for two disjoint minimal dominating sets (Q2414045) (← 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)
• (Q3751618) (← links)
• New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets (Q5261609) (← links)
• A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given (Q5500391) (← links)