Minimal Dirichlet Energy Partitions for Graphs
From MaRDI portal
Publication:2930001
DOI10.1137/130934568zbMath1302.05146arXiv1308.4915OpenAlexW2045625774MaRDI QIDQ2930001
No author found.
Publication date: 17 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4915
No records found.
No records found.
Related Items (16)
A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors ⋮ The method of fundamental solutions applied to boundary eigenvalue problems ⋮ Uncertainty Quantification in Graph-Based Classification of High Dimensional Data ⋮ A minimal surface criterion for graph partitioning ⋮ A theory of spectral partitions of metric graphs ⋮ Diffusion generated methods for denoising target-valued images ⋮ Optimal partition problems for the fractional Laplacian ⋮ An Efficient Unconditionally Stable Method for Dirichlet Partitions in Arbitrary Domains ⋮ A novel partitioning method for block-structured adaptive meshes ⋮ Consistency of Dirichlet Partitions ⋮ Extremal spectral gaps for periodic Schrödinger operators ⋮ An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs ⋮ An effective region force for some variational models for learning and clustering ⋮ A diffusion generated method for computing Dirichlet partitions ⋮ A level set method for the Dirichlet \(k\)-partition problem ⋮ Efficient algorithm for optimizing spectral partitions
This page was built for publication: Minimal Dirichlet Energy Partitions for Graphs
