The complexity of finding uniform sparsest cuts in various graph classes (Q450559)
From MaRDI portal
!
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 6082050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding uniform sparsest cuts in various graph classes |
scientific article; zbMATH DE number 6082050 |
Statements
The complexity of finding uniform sparsest cuts in various graph classes (English)
0 references
13 September 2012
0 references
sparsest cut
0 references
parameterized complexity
0 references
treewidth
0 references
clique-width
0 references
unit interval graph
0 references
0 references
0.8678157329559326
0 references
0.8549574613571167
0 references
0.8151044845581055
0 references
0.8046039342880249
0 references
