0

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

ChaosPredictor
  • 373
  • 2
  • 14
  • 1
    BTW, there is a simple answer to this on StackExchange itself: https://cs.stackexchange.com/questions/126935/using-a-greedy-algorithm-to-find-a-cut-s-which-at-least-half-of-the-edges-cut?rq=1 – Inuyasha Yagami Jan 20 '21 at 20:44

1 Answers1

1

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 :)

Inuyasha Yagami
  • 6,157
  • 1
  • 11
  • 23