A new regularity lemma and faster approximation algorithms for low threshold rank graphs (Q6828895)
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 6474896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new regularity lemma and faster approximation algorithms for low threshold rank graphs |
scientific article; zbMATH DE number 6474896 |
Statements
A new regularity lemma and faster approximation algorithms for low threshold rank graphs (English)
0 references
21 August 2015
0 references
regularity lemma
0 references
approximation algorithm
0 references
expander graphs
0 references
low threshold rank graphs
0 references
maximum cut
0 references
