A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865)
From MaRDI portal
(Redirected from Item:Q2941636)
 | 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: A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs |
scientific article; zbMATH DE number 6474896
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
0 references
4 October 2013
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
0.99825119972229
0 references
0.8024975061416626
0 references
0.7954240441322327
0 references
