A minimal surface criterion for graph partitioning (Q338611)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6648207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimal surface criterion for graph partitioning |
scientific article; zbMATH DE number 6648207 |
Statements
A minimal surface criterion for graph partitioning (English)
0 references
7 November 2016
0 references
graph partition
0 references
clustering
0 references
Beltrami energy
0 references
minimal surface
0 references
primal-dual hybrid gradients
0 references
convex optimization
0 references
bilevel optimization
0 references
threshold dynamics
0 references
rearrangement algorithm
0 references
0 references
0 references
0 references
0 references
0.89759207
0 references
0 references
0.89243346
0 references
0.8870961
0 references
0.8842182
0 references
0.8775462
0 references
0.87625325
0 references
