Pages that link to "Item:Q1199938"

The following pages link to A self-stabilizing algorithm for maximal matching (Q1199938):

Displaying 19 items.

• A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
• A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← 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)
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
• A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
• A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
• Timer-based composition of fault-containing self-stabilizing protocols (Q985053) (← links)
• A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
• Maximal matching stabilizes in quadratic time (Q1321812) (← links)
• Maximal matching stabilizes in time \(O(m)\) (Q1607119) (← links)
• A self-stabilizing algorithm for \(b\)-matching (Q1625602) (← links)
• A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
• The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
• Self-Stabilizing Domination Algorithms (Q3384122) (← links)
• A self-stabilizing algorithm for the st-order problem (Q3499020) (← links)
• Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
• A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)