Pages that link to "Item:Q2015142"
From MaRDI portal
The following pages link to A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142):
Displaying 10 items.
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
- Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model (Q1003766) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950) (← links)
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model (Q2460592) (← 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)
- Brief announcement: Fully lattice linear algorithms (Q6155259) (← links)
- Extending Lattice Linearity for Self-stabilizing Algorithms (Q6488448) (← links)
