An efficient distributed algorithm for maximum matching in general graphs
From MaRDI portal
Publication:911306
DOI10.1007/BF01840395zbMATH Open0696.68079MaRDI QIDQ911306FDOQ911306
Authors: Michael M. Wu, Michael C. Loui 
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Theory of operating systems (68N25)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Complexity of network synchronization
- TWO THEOREMS IN GRAPH THEORY
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- The general maximum matching algorithm of Micali and Vazirani
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- A new distributed depth-first-search algorithm
- A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs
Cited In (9)
- A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed maximum maintenance on hierarchically divided graphs
- Stabilizing maximum matching in bipartite networks
- Maintaining bipartite matchings in the presence of failures
- Algorithms – ESA 2004
- An efficient distributed algorithm for finding all hinge vertices in networks
- Distributed Algorithm for Better Approximation of the Maximum Matching
This page was built for publication: An efficient distributed algorithm for maximum matching in general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911306)
