(2009) reported that b-matching graphs achieve semi-supervised classification accuracy higher than k-NN graphs.
without approximation, building a b-matching graph is prohibitive in terms of computational complexity.