This paper approximates -resistance for multi-class graph clustering.
problem Efficiently clustering graphs with -Laplacian bias.
method Developed an approximation to -resistance for multi-class clustering.
result Approximated -resistance provides a computationally feasible alternative to -Laplacian eigenvectors.