The complexity of finding uniform sparsest cuts in various graph classes (Q450559): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C99 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6082050 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparsest cut | |||
| Property / zbMATH Keywords: sparsest cut / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
treewidth | |||
| Property / zbMATH Keywords: treewidth / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
clique-width | |||
| Property / zbMATH Keywords: clique-width / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
unit interval graph | |||
| Property / zbMATH Keywords: unit interval graph / rank | |||
Normal rank | |||
Revision as of 10:14, 30 June 2023
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
