A simple algorithm for constructing Szemerédi's regularity partition
From MaRDI portal
Publication:1283876
zbMath0917.05070MaRDI QIDQ1283876
Alan M. Frieze, Ravindran Kannan
Publication date: 31 March 1999
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119828
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Large deviations of subgraph counts for sparse Erdős-Rényi graphs ⋮ On Regularity Lemmas and their Algorithmic Applications ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Regularity lemmas for clustering graphs ⋮ A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
