Pages that link to "Item:Q930908"

The following pages link to Distance-\(k\) knowledge in self-stabilizing algorithms (Q930908):

Displaying 14 items.

• A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
• Efficient transformation of distance-2 self-stabilizing algorithms (Q433436) (← links)
• A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← 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 \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142) (← links)
• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
• Self-Stabilizing Domination Algorithms (Q3384122) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)