Pages that link to "Item:Q666086"
From MaRDI portal
The following pages link to A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086):
Displaying 17 items.
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets (Q501004) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142) (← links)
- Self-stabilizing distributed algorithm for local mutual inclusion (Q2345850) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- Self-stabilizing algorithm for two disjoint minimal dominating sets (Q2414045) (← links)
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets (Q5261609) (← links)
- Fault tolerant network constructors (Q6044462) (← links)
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
- Extending Lattice Linearity for Self-stabilizing Algorithms (Q6488448) (← links)
- Fault tolerant network constructors (Q6536337) (← links)
- Self-stabilizing \((\varDelta +1)\)-coloring in sublinear (in \(\varDelta\)) rounds via locally-iterative algorithms (Q6591474) (← links)
- Luby's MIS algorithms made self-stabilizing (Q6663516) (← links)
