Min-Graph Equipartition Problem
1
Can someone plis help me with this problem. Split the graph into two parts of almost the same size with the smallest number of edges between the two parts.
graph-theory
share | cite | improve this question
asked Dec 9 at 8:44
what_456
8 3
"Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
– Alex Ravsky
Dec 9 a