A self-stabilizing algorithm for b-matching
From MaRDI portal
A self-stabilizing algorithm for \(b\)-matching
Recommendations
- A self-stabilizing algorithm for maximal matching
- scientific article; zbMATH DE number 1735731
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
- A faster algorithm for the Strongly Stable \(b\)-Matching Problem
- An extendable stable matching algorithm of a kind of bipartite graph
Cites work
- scientific article; zbMATH DE number 1863300 (Why is no real title available?)
- A self-stabilizing algorithm for maximal matching
- A self-stabilizing algorithm for maximal matching in anonymous networks
- An efficient self-stabilizing distance-2 coloring algorithm
- Compact self-stabilizing leader election for general networks
- Dynamic and self-stabilizing distributed matching
- Maximal matching stabilizes in quadratic time
- Maximal matching stabilizes in time \(O(m)\)
- Self-stabilization
Cited in
(5)- scientific article; zbMATH DE number 1863300 (Why is no real title available?)
- Self-stabilizing distributed stable marriage
- Stabilizing maximum matching in bipartite networks
- A self-stabilizing algorithm for the st-order problem
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
This page was built for publication: A self-stabilizing algorithm for \(b\)-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625602)