Author:
Czumaj Artur,Sohler Christian
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. In Proc. 40th FOCS, pages 656–666, 1999.
2. N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh. Coloring 2-colorable hypergraphs with a sublinear number of colors. Nordic Journal of Computing, 3:425–439, 1996.
3. N. Alon and M. Krivelevich. To appear in SIAM Journal on Discrete Mathematics.
4. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing, 29(1):180–200, September 1999.
5. J. Beck. An algorithmic approach to the Lovász local lemma. I. Random Structures and Algorithms, 2(4):343–365, 1991.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved Dynamic Graph Coloring;ACM Transactions on Algorithms;2020-06-26
2. Testing monotonicity over graph products;Random Structures and Algorithms;2008
3. A Lower Bound for Distribution-Free Monotonicity Testing;Lecture Notes in Computer Science;2005
4. Testing subgraphs in directed graphs;Journal of Computer and System Sciences;2004-11
5. Testing the Independence Number of Hypergraphs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2004