Approximating sparsest cut in graphs of bounded treewidth (Q3588403)
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: Approximating sparsest cut in graphs of bounded treewidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating sparsest cut in graphs of bounded treewidth |
scientific article |
Statements
Approximating Sparsest Cut in Graphs of Bounded Treewidth (English)
0 references
10 September 2010
0 references
0.896416962146759
0 references
0.8343289494514465
0 references
0.7908785939216614
0 references
0.7852108478546143
0 references
0.7849604487419128
0 references
