This principle can be called Branching Markov Clustering (BMCL) in the sense that it makes it possible to correct for unbalances in cluster-sizes by dividing large Markov clusters into appropriate branches.
bMCL is a way of rebuilding adjacency relationships "inside" MCL clusters, by making reference to "outside" path information.