Abstract:
Given an undirected weighted graph G, finding the maximum weighted matching (MWM) on G is one of the most classic combinatorial optimization problems. In distributed graph algorithms (such as CONGEST and...
Abstract:
Given an undirected weighted graph G, finding the maximum weighted matching (MWM) on G is one of the most classic combinatorial optimization problems. In distributed graph algorithms (such as CONGEST and...