A self-stabilizing weighted matching algorithm

Authors:
Fredrik Manne;Morten Mjelde
Affiliations:
University in Bergen, Norway;University in Bergen, Norway
Venue:
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Year:
2007

Citing 8
Cited 4

A self-stabilizing algorithm for maximal matching

Information Processing Letters
Maximal matching stabilizes in quadratic time

Information Processing Letters
Self-stabilization

Self-stabilization
Maximal matching stabilizes in time O(m)

Information Processing Letters
Dynamic and self-stabilizing distributed matching

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A linear-time approximation algorithm for weighted matchings in graphs

ACM Transactions on Algorithms (TALG)
A new self-stabilizing maximal matching algorithm

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity

A new self-stabilizing maximal matching algorithm

Theoretical Computer Science
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

Theoretical Computer Science
Adaptive distributed b-matching in overlays with preferences

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of computing a matching in a graph involves creating pairs of neighboring nodes such that no node is paired more than once. Previous work on the matching problem has resulted in several selfstabilizing algorithms for finding a maximal matching in an unweighted graph. In this paper we present the first self-stabilizing algorithm for the weighted matching problem. We show that the algorithm computes a 1/2-approximation to the optimal solution. The algorithm is simple and uses only a fixed number of variables per node. Stabilization is shown under various types of daemons.