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 the normal view instead:
scientific article; zbMATH DE number 7869027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7890229225158691
0 references
0.7854542136192322
0 references
0.7730860710144043
0 references
0.7710393667221069
0 references
0.766900360584259
0 references
