I have the following graph partitioning problem:
Given a tree graph with N nodes represented by its incidence matrix A (N by N), we choose k-1 edges to remove from the graph and partition it into k zones. We want to figure out the incidence matrices of the zones (A1,..Ak).
Could anyone help me how to solve this problem? Any algorithm or function?
I appreciate your help.