Polynomiality of sparsest cuts with fixed number of sources (Q2467444)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomiality of sparsest cuts with fixed number of sources |
scientific article |
Statements
Polynomiality of sparsest cuts with fixed number of sources (English)
0 references
21 January 2008
0 references
sparsest cut problem
0 references
fixed number of sources
0 references
polynomiality
0 references
0 references
