This definition appears very rarely
See other definitions of RPMC
Samples in periodicals archive:
A heuristic approach called recursive partitioning by minimum cuts is developed and is tested on a large number of random graphs.
The second approach is a top-down technique, called Recursive Partitioning by Minimum Cuts (RPMC), that is based on a generalized minimum cut operation.
Two heuristic algorithms that meet the above claims are the Recursive Partitioning by Minimum Cuts (RPMC) and the Pairwise Grouping of Adjacent Nodes (PGAN).
6.4 Recursive Partitioning by Minimum Cuts (RPMC) - 6.5 Non-uniform Filterbank Example - 7 Pairwise Grouping of Adjacent Nodes - 7.1 Proper Clustering...