Algorithmic aspects of regularity
From MaRDI portal
Recommendations
- The Algorithmic Aspects of the Regularity Lemma
- On regularity lemmas and their algorithmic applications
- Algorithmic regularity for polynomials and applications
- scientific article; zbMATH DE number 1256685
- Regularity lemmas and combinatorial algorithms
- Regularity Lemmas and Combinatorial Algorithms
- An Optimal Algorithm for Checking Regularity
- Some regularity properties of algorithms and additive functions with respect to them
- Scientific article; zbMATH DE number 2119673
- scientific article; zbMATH DE number 866556
Cited in
(10)- A simple algorithm for constructing Szemerédi's regularity partition
- scientific article; zbMATH DE number 1256685 (Why is no real title available?)
- The Algorithmic Aspects of the Regularity Lemma
- Szemerédi's regularity lemma and quasi-randomness
- scientific article; zbMATH DE number 2119673 (Why is no real title available?)
- Regularity Lemmas and Combinatorial Algorithms
- Can a graph have distinct regular partitions?
- On regularity lemmas and their algorithmic applications
- Ringel's tree packing conjecture in quasirandom graphs
- Properties of regular systems and algorithmic improvements for regular decomposition
This page was built for publication: Algorithmic aspects of regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508358)