The attached is an example that is based on Gomory-Hu trees.
Are you thinking about using a dynamic algorithm because a sequential one would take longer to complete or because there is indeed no way to know the size of the graph at a given moment?
If you are looking for speed, perhaps you can use a parallel algorithm (?). The second paper I am attaching is an excellent survey to graph partitioning algorithms.