Pages that link to "Item:Q597323"
From MaRDI portal
The following pages link to Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323):
Displaying 30 items.
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← 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 survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- Self-stabilizing deterministic network decomposition (Q697021) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- MinMax algorithms for stabilizing consensus (Q1981802) (← links)
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142) (← links)
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction (Q2015150) (← links)
- Loosely-stabilizing maximal independent set algorithms with unreliable communications (Q2089676) (← links)
- Self-stabilizing distributed algorithm for local mutual inclusion (Q2345850) (← links)
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler (Q2379950) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Self-stabilizing algorithm for two disjoint minimal dominating sets (Q2414045) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← 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)
- A self-stabilizing algorithm for the st-order problem (Q3499020) (← links)
- A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET (Q3569287) (← links)
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler (Q4639900) (← links)
- New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets (Q5261609) (← links)
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
- Brief announcement: Fully lattice linear algorithms (Q6155259) (← links)
- Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications (Q6488445) (← links)
- Extending Lattice Linearity for Self-stabilizing Algorithms (Q6488448) (← links)
