Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based a greedy-type metric clustering augmentation scheme, we show how partition can be generated in an efficient way graphs. We investigate PUMs combined with local basis function (GBF) approximation method order to obtain low-cost global interpolation or classification schem...