Pages that link to "Item:Q338611"
From MaRDI portal
The following pages link to A minimal surface criterion for graph partitioning (Q338611):
Displaying 9 items.
- An efficient primal-dual method for the obstacle problem (Q1685519) (← links)
- A diffusion generated method for computing Dirichlet partitions (Q1715826) (← links)
- Diffusion generated methods for denoising target-valued images (Q2176514) (← links)
- A level set method for the Dirichlet \(k\)-partition problem (Q2221149) (← links)
- Efficient algorithm for optimizing spectral partitions (Q2335125) (← links)
- PDE acceleration: a convergence rate analysis and applications to obstacle problems (Q2336046) (← links)
- Consistency of Dirichlet Partitions (Q4592868) (← links)
- A continuum limit for the PageRank algorithm (Q5056774) (← links)
- Uniqueness of a solution to a general class of discrete system defined on connected graphs (Q6185370) (← links)
