Stabilizing maximum matching in bipartite networks

DOI10.1007/S00607-009-0025-ZzbMath1177.05093OpenAlexW2080310055MaRDI QIDQ1014349

Rachid Hadid, Mehmet Hakan Karaata

Publication date: 27 April 2009

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-009-0025-z

zbMATH Keywords

bipartite graphfault tolerancemaximum matchingdistributed systemself-stabilizationdistributed stabilizing algorithmPIF algorithmpropagation of information with feedback and cleaning

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Stabilization-preserving atomicity refinement
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing depth-first token circulation on networks
• Fault-containing self-stabilization using priority scheduling
• TWO THEOREMS IN GRAPH THEORY
• Efficient algorithms for finding maximum matching in graphs
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Dynamic and self-stabilizing distributed matching
• Paths, Trees, and Flowers
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Stabilizing maximum matching in bipartite networks