Maximal matching stabilizes in quadratic time
From MaRDI portal
Publication:1321812
DOI10.1016/0020-0190(94)90098-1zbMath0803.68042OpenAlexW1976297454MaRDI QIDQ1321812
Publication date: 3 May 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)90098-1
Related Items (8)
A self-stabilizing algorithm for \(b\)-matching ⋮ Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem ⋮ A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 ⋮ A new self-stabilizing maximal matching algorithm ⋮ Self-Stabilizing Domination Algorithms ⋮ Maximal matching stabilizes in time \(O(m)\)
Cites Work
This page was built for publication: Maximal matching stabilizes in quadratic time
