A deterministic algorithm for the Frieze-Kannan regularity lemma
DOI10.1137/110846373zbMATH Open1245.05127OpenAlexW1997230618WikidataQ124881250 ScholiaQ124881250MaRDI QIDQ2902884FDOQ2902884
Authors: Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel Martin, Vojtěch Rödl, Asaf Shapira 
Publication date: 22 August 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110846373
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25)
Cited In (10)
- Erratum to: ``On regularity lemmas and their algorithmic applications
- Graph summarization with quality guarantees
- Regularity lemmas and combinatorial algorithms
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- An optimal algorithm for finding Frieze-Kannan regular partitions
- Title not available (Why is that?)
- Amplification and Derandomization without Slowdown
- On regularity lemmas and their algorithmic applications
- A fast new algorithm for weak graph regularity
- An algorithmic version of the blow-up lemma
This page was built for publication: A deterministic algorithm for the Frieze-Kannan regularity lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902884)
