The complexity of finding uniform sparsest cuts in various graph classes (Q450559): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2011.12.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2011.12.008 / rank | |||
Normal rank | |||
Latest revision as of 17:59, 9 December 2024
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
sparsest cut
0 references
parameterized complexity
0 references
treewidth
0 references
clique-width
0 references
unit interval graph
0 references
0 references
