Search Results for author:
Found 1 papers, 0 papers with code
Minimal Dirichlet energy partitions for graphs
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
