Pages that link to "Item:Q2390286"
From MaRDI portal
The following pages link to An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286):
Displaying 9 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)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (Q3455752) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
