Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
An Algorithmic Version of the Hypergraph Regularity Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Dirac-Type Theorem for 3-Uniform Hypergraphs
Combinatorics, Probability and Computing
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
Szemerédi's regularity lemma and its applications to pairwise clustering and segmentation
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
Computational complexity of the hamiltonian cycle problem in dense hypergraphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
In this paper, we will consider the problem of designing an efficient algorithm that finds an $\epsilon$-regular partition of an l-uniform hypergraph.