Mega-Merger

Mega-merger is a distributed algorithm aimed at solving the election problem in generic connected undirected graph.[1][2]

  1. ^ Gallager, Robert (1983). "A distributed algorithm for minimum spanning tree" (PDF). Massachusetts Institute of Technology.
  2. ^ Awerbuch, Baruch (1987). "Optimal Distributed Algorithm for Minimum Weight Spanning Tree, Counting, Leader Election and Other Problems" (PDF). SIAM Journal on Computing.