Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multi-way sparsest cut problem on trees with a control on the number of parts and outliers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-way sparsest cut problem on trees with a control on the number of parts and outliers |
scientific article |
Statements
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (English)
0 references
29 December 2020
0 references
sparsest cut problem
0 references
isoperimetric number
0 references
Cheeger constant
0 references
normalized cut
0 references
graph partitioning
0 references
computational complexity
0 references
weighted trees
0 references
0 references
0.7806941270828247
0 references
0.7802472114562988
0 references
0.7771195769309998
0 references
0.7598210573196411
0 references
0.7493410110473633
0 references
