论文信息 - A Simple Algorithm for Constructing Szemere'di's Regularity Partition - 字舞流文

A Simple Algorithm for Constructing Szemere'di's Regularity Partition

We give a simple constructive version of Szemeredi's Regularity Lemma, based on the computation of singular values of matrices.

Alan M. Frieze | Ravi Kannan

[1] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[2] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[3] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[4] Vojtech Rödl,et al. An Algorithmic Regularity Lemma for Hypergraphs , 2000, SIAM J. Comput..

[5] Alan M. Frieze,et al. The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[6] Vojtech Rödl,et al. The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.