论文信息 - An Algorithmic Regularity Lemma for Hypergraphs

An Algorithmic Regularity Lemma for Hypergraphs

In this paper, we will consider the problem of designing an efficient algorithm that finds an $\epsilon$-regular partition of an l-uniform hypergraph.

Vojtech Rödl | Andrzej Czygrinow

[1] H. Prömel,et al. Excluding Induced Subgraphs III: A General Asymptotic , 1992 .

[2] Fan Chung Graham,et al. Regularity Lemmas for Hypergraphs and Quasi-randomness , 1991, Random Struct. Algorithms.

[3] Vojtech Rödl,et al. A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..

[4] Alan M. Frieze,et al. Quick Approximation to Matrices and Applications , 1999, Comb..

[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. Constructive Quasi-Ramsey Numbers and Tournament Ranking , 1999, SIAM J. Discret. Math..

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

[8] Alan M. Frieze,et al. A Simple Algorithm for Constructing Szemere'di's Regularity Partition , 1999, Electron. J. Comb..

[9] Vojtech Rödl,et al. The asymptotic number of triple systems not containing a fixed one , 2001, Discret. Math..

[10] Vojtech Rödl,et al. The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[11] Vojtech Rödl,et al. The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..