Abstract
In this paper, we will consider the problem of designing an efficient algorithm that finds an ∈-regular partition of an l-uniform hypergraph.
Original language | English (US) |
---|---|
Pages (from-to) | 1041-1066 |
Number of pages | 26 |
Journal | SIAM Journal on Computing |
Volume | 30 |
Issue number | 4 |
DOIs | |
State | Published - 2000 |
Keywords
- Algorithms
- Hypergraphs
- Regularity lemma
ASJC Scopus subject areas
- General Computer Science
- General Mathematics