Semidefinite Programming Based Algorithms for the Sparsest Cut Problem (Q4917216): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1051/ro/2011104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2118059629 / rank | |||
Normal rank | |||
Latest revision as of 20:31, 19 March 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
