An algorithmic regularity lemma for hypergraphs

Andrzej Czygrinow, Vojtech Rödl

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


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

Original languageEnglish (US)
Pages (from-to)1041-1066
Number of pages26
JournalSIAM Journal on Computing
Issue number4
StatePublished - 2000


  • Algorithms
  • Hypergraphs
  • Regularity lemma

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'An algorithmic regularity lemma for hypergraphs'. Together they form a unique fingerprint.

Cite this