0
$\begingroup$

Can someone remind me the algorithm that split vertex of graph to 2 groups that at least half of the edges are external, I mean between the groups. As I remember it was a greedy algorithm, each time chosen the vertex with highest number of edges, or something similar

$\endgroup$
1
1
$\begingroup$

The solution and the analysis is given in Section 6.2.1 and 6.3 of the Book: Probability and Computing Randomized Algorithms and Probabilistic Analysis

Sometimes it is better to refer to a book rather than formulating an answer by ourselves :)

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.