Pages that link to "Item:Q2379950"

The following pages link to Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950):

Displaying 11 items.

• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
• Efficient transformation of distance-2 self-stabilizing algorithms (Q433436) (← links)
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
• A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142) (← links)
• Self-stabilizing distributed algorithm for local mutual inclusion (Q2345850) (← links)
• Self-Stabilizing Domination Algorithms (Q3384122) (← links)
• Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (Q3455752) (← links)
• Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
• Distributed Self-Stabilizing MIS with Few States and Weak Communication (Q6202267) (← links)