Semidefinite Programming Based Algorithms for the Sparsest Cut Problem (Q4917216): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:36, 8 February 2024
scientific article; zbMATH DE number 6159178
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite Programming Based Algorithms for the Sparsest Cut Problem |
scientific article; zbMATH DE number 6159178 |
Statements
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem (English)
0 references
29 April 2013
0 references
semidefinite programming
0 references
sparsest cut
0 references
combinatorics
0 references
