Author:
Rödl V.,Schacht M.,Siggers M.H.,Tokushige N.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. The algorithmic aspects of the regularity lemma;Alon;J. Algorithms,1994
2. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, 29 May–1 June 1995, pp. 284–293
3. Constructive quasi-Ramsey numbers and tournament ranking;Czygrinow;SIAM J. Discrete Math.,1999
4. Graph decomposition is NP-complete: A complete proof of Holyer's conjecture;Dor;SIAM J. Comput.,1997
5. Near perfect coverings in graphs and hypergraphs;Frankl;European J. Combin.,1985
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cycle decompositions in k-uniform hypergraphs;Journal of Combinatorial Theory, Series B;2024-07
2. Fractional cycle decompositions in hypergraphs;Random Structures & Algorithms;2021-12-14
3. Fractional clique decompositions of dense graphs and hypergraphs;Journal of Combinatorial Theory, Series B;2017-11
4. Constructive Packings of Triple Systems;SIAM Journal on Discrete Mathematics;2017-01
5. Constructive Packings by Linear Hypergraphs;Combinatorics, Probability and Computing;2013-09-12