algorithm - Spark GraphX: Independent edge set (matching) -
given graph g: graph[vd, int], how compute maximal weighted independent edge set (matching)? i'm interested in greedy solution edges selected in greatest-weight-first order. i've devised both pregel , iterative message aggregating solution work, wildly inefficient.
Comments
Post a Comment