N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats

@inproceedings{Shamir1982NProcessorsGD,
  title={N-Processors Graph Distributively Achieve Perfect Matchings in O(log2N) Beats},
  author={Eli Shamir and Eli Upfal},
  booktitle={PODC},
  year={1982}
}
A perfect matching in a graph G(V,E), also called a 1-factor, is a collection P of non-interesting edges engaging (incident with) all the vertices; in case G is bipartite V &equil; M @@@@ F, M @@@@ F &equil; &fgr;, P should engage all the vertices of M. The combinatorial problem of finding a perfect matching in G (and its rich ramifications) were extensively studied (and applied) from existential, algorithmic and probabilistic points of view. Here we replace sequential algorithms by… CONTINUE READING