A fast new algorithm for weak graph regularity (Q5222555)
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: A fast new algorithm for weak graph regularity |
scientific article; zbMATH DE number 7186362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast new algorithm for weak graph regularity |
scientific article; zbMATH DE number 7186362 |
Statements
A fast new algorithm for weak graph regularity (English)
0 references
6 April 2020
0 references
edge density
0 references
regularity method
0 references
0 references
0 references
0.8990102
0 references
0.8921071
0 references
0.88482213
0 references
0.88275325
0 references
0.88275325
0 references
0.88222164
0 references
0.87971675
0 references
0.8785374
0 references
