A fast new algorithm for weak graph regularity
We provide a deterministic algorithm that finds, in ϵ-O(1) n 2 time, an ϵ-regular Frieze-Kannan partition of a graph on n vertices. The algorithm outputs an approximation of a given graph as a weighted sum of ϵ-O(1) many complete bipartite graphs. As a corollary, we give a deterministic algorithm fo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press (CUP),
2020-07-14T15:18:41Z.
|
| Subjects: | |
| Online Access: | Get fulltext |