I have a question regarding graph cuts in graph theory. Suppose that there exists a graph G and I was to implement a graph cut to partition the vertices in graph G into two subsets A and B. Would the vertices in each of these partitions need to be connected? Are there any further requirements that need to be satisfied by the cut and the resulting partitions?

Thank you.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.