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: | Lovász, László Miklós (Author), Zhao, Yufei (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Cambridge University Press (CUP),
2020-07-14T15:18:41Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Regularity and removal lemmas and their applications
by: Lovász, László Miklós
Published: (2017) -
Elusive extremal graphs
by: Grzesik, Andrzej, et al.
Published: (2022) -
Greedy algorithms for random regular graphs
by: Beis, Michail
Published: (2006) -
Analysis and Adaption of Graph Mapping Algorithms for Regular Graph Topologies
by: Rinke, Sebastian
Published: (2009) -
Analysis and Adaption of Graph Mapping Algorithms for Regular Graph Topologies
by: Rinke, Sebastian
Published: (2009)