Distributed Approximate Matching (DAM). Zvi Lotker, Boaz Patt-Shamir, Adi Rosen Presentation: Deniz Çokuslu May 2008. Motivation. Matching A matching M in a graph G is a set of nonloop edges with no shared endpoints.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Zvi Lotker, Boaz Patt-Shamir, Adi Rosen
Presentation: Deniz Çokuslu
*J.-H. Hoepman. Simple Distributed WeightedMatchings CoRR cs.DC/0410047, 2004
* A. Israeli and A. Itai. A fast and simple randomizedparallel algorithm for maximal matching. Info. Proc.Lett., 22(2):77–80, 1986
e3DAM in Unweighted Dynamic Graphs