On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (Q6559388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems |
scientific article; zbMATH DE number 7869027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems |
scientific article; zbMATH DE number 7869027 |
Statements
On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (English)
0 references
21 June 2024
0 references
parameterized complexity
0 references
sparsest cut
0 references
vertex cover
0 references
treewidth
0 references
small-set expansion
0 references
