A simple algorithm for constructing Szemerédi's Regularity Partition

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Frieze, Alan ^a   Kannan, Ravi ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003773292     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1449     Document Type: Review

References (9)

1. N.Alon, R.A.Duke, H.Lefmann, V.Rödl and R.Yuster, The algorithmic aspects of the Regularity Lemma, Journal of Algorithms 16 (1994) 80-109.
2. A.Czygrinow and V.Rödl, Algorithmic Regularity Lemma for Hypergraphs, in preparation.
3. A.M.Frieze and R.Kannan, The Regularity Lemma and approximation schemes for dense problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, (1996) 12-20.
4. A.M.Frieze and R.Kannan, Quick approximations to matrices and applications, to appear in Combinatorica.
5. G.H.Golub and C.F.Van Loan, Matrix Computations, Johns Hopkins University Press, London, 1989.
6. J.Komlós and M.Simonovits, Szemerédi's regularity Lemma and its applications in graph theory, Combinatorics, Paul Erdos is Eighty, Bolyai Society Mathematical Studies, 2, D.Miklós, V.T.Sós and T.Szonyi Eds., (1996) 295-352.
7. P.Raghavan, Probabilistic construction of deterministic algorithms: Approxiamting packing integer programs, Journal of Computer and System Sciences 37 (1988) 130-143.
8. J.Spencer, Ten lectures on the probabilistic method, SIAM, Philadelphia, 1987.
9. E.Szemerédi, Regular partitions of graphs, Proceedings, Colloque Inter. CNRS (J.-C. Bermond, J.-C.Fournier, M.Las Vergnas and D.Sotteau, Eds.) (1978) 399-401.