Graph algorithm based submodular function for sparsest cut problem (Q6955231)
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 8067669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph algorithm based submodular function for sparsest cut problem |
scientific article; zbMATH DE number 8067669 |
Statements
Graph algorithm based submodular function for sparsest cut problem (English)
0 references
23 July 2025
0 references
bipartition
0 references
sparsest cut problem
0 references
sparsity
0 references
submodular function
0 references
principal partition
0 references
