The complexity of finding uniform sparsest cuts in various graph classes (Q450559)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding uniform sparsest cuts in various graph classes |
scientific article |
Statements
The complexity of finding uniform sparsest cuts in various graph classes (English)
0 references
13 September 2012
0 references
