no code implementations • 22 Aug 2013 • Braxton Osting, Chris D. White, Edouard Oudet
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components.