A distributed algorithm to find maximum matching in a graph was presented. The algorithm runs in O(log6n) steps. The network was represented by an undirected graph where each vertex represents a processor and each edge corresponds to a connection between processors in the network. The maximal matching algorithm constructs graph spanners in blocks and use these spanners to compute matchings. An auxiliary multigraph was created to consider mutigraphs instead of simple graphs.
- Distributed algorithm
- Maximum matching
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics