The Algorithmic Aspects of the Regularity Lemma
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. On graph-theoretic lemmata and complexity classes , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[2] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .
[3] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[4] Vojtech Rödl. On universality of graphs with uniformly distributed edges , 1986, Discret. Math..
[5] Zoltán Füredi,et al. Exact solution of some Turán-type problems , 1987, J. Comb. Theory, Ser. A.
[6] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[7] Zoltán Füredi,et al. The maximum number of edges in a minimal graph of diameter 2 , 1992, J. Graph Theory.
[8] Wolfgang Maass,et al. On the communication complexity of graph properties , 1988, STOC '88.
[9] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[10] Vojtech Rödl,et al. The Ramsey number of a graph with bounded maximum degree , 1983, J. Comb. Theory, Ser. B.
[11] B. Bollobás,et al. Extremal Graphs without Large Forbidden Subgraphs , 1978 .
[12] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[15] Vojtech Rödl,et al. A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..
[16] Miklós Simonovits,et al. Szemerédi's Partition and Quasirandomness , 1991, Random Struct. Algorithms.
[17] Vojtech Rödl,et al. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..
[18] Zoltán Füredi,et al. On the Maximum Number of Triangles in Wheel-Free Graphs , 1994, Comb. Probab. Comput..
[19] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.
[20] Noga Alon,et al. AlmostH-factors in dense graphs , 1992, Graphs Comb..
[21] Vojtech Rödl,et al. On subsets of abelian groups with no 3-term arithmetic progression , 1987, J. Comb. Theory, Ser. A.
[22] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[23] V. Rödl,et al. On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..
[24] Vojtech Rödl,et al. Random Graphs with Monochromatic Triangles in Every Edge Coloring , 1994, Random Struct. Algorithms.
[25] Noga Alon,et al. Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory , 1986, Comb..
[26] Noga Alon,et al. A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.