An algorithmic regularity lemma for hypergraphs

Authors
Czygrinow, A Rodl, V
Citation
A. Czygrinow et V. Rodl, An algorithmic regularity lemma for hypergraphs, SIAM J COMP, 30(4), 2000, pp. 1041-1066
Citations number
12
Categorie Soggetti
Computer Science & Engineering
Journal title
SIAM JOURNAL ON COMPUTING
ISSN journal
00975397 → ACNP
Volume
30
Issue
4
Year of publication
2000
Pages
1041 - 1066
Database
ISI
SICI code
0097-5397(20001012)30:4<1041:AARLFH>2.0.ZU;2-3
Abstract
In this paper, we will consider the problem of designing an efficient algor ithm that finds an epsilon -regular partition of an l-uniform hypergraph.