Pages that link to "Item:Q433436"
From MaRDI portal
The following pages link to Efficient transformation of distance-2 self-stabilizing algorithms (Q433436):
Displaying 12 items.
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- A self-stabilizing algorithm for edge monitoring in wireless sensor networks (Q528199) (← 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)
- A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
- Self-stabilizing local \(k\)-placement of replicas with local minimum variance (Q2354401) (← links)
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
- Self-stabilizing algorithms for efficient sets of graphs and trees (Q2445247) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)