3 citations · 3 across the 1 of their papers we have counts for
1 paper
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid +2
An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S ⊆ V that maximizes the number o…