Testing hypergraph colorability

Theoretical Computer Science

Volumn 331, Issue 1, 2005, Pages 37-52

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a University Heights   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Hypergraph algorithms; Hypergraph coloring; Hypergraphs; Property testing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

HYPERGRAPH ALGORITHM; HYPERGRAPH COLORING; HYPERGRAPHS; PROPERTY TESTING;

GRAPH THEORY;

EID: 15744399663     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.031     Document Type: Conference Paper

References (35)

1. N. Alon, W. Fernandez de la Vega, R. Kannan, and M. Karpinski Random sampling and approximation of MAX-CSP problems Proc. 34th Ann. ACM Symp. on Theory of Computing (STOC) 2002 ACM Press New York 232 239
2. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy Efficient testing of large graphs Combinatorica 20 4 2000 451 476
3. N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh Coloring 2-colorable hypergraphs with a sublinear number of colors Nord. J. Comput. 3 1996 425 439
4. N. Alon, and M. Krivelevich Testing k-colorability SIAM J. Discrete Math. 15 2 2002 211 227
5. N. Alon, and A. Shapira Testing satisfiability J. Algorithms 47 2 2003 87 103
6. G. Andersson, and L. Engebretsen Property testers for dense constraint satisfaction programs on finite domains Random Struct. Algorithms 21 1 2002 14 32
7. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal Balanced allocations SIAM J. Comput. 29 1 1999 180 200
8. J. Beck An algorithmic approach to the Lovász local lemma. I Random Struct. Algorithms 2 4 1991 343 365
9. M.A. Bender, and D. Ron Testing properties of directed graphs Acyclicity and connectivity Random Struct. Algorithms 20 2 2002 184 205
10. M. Blum, M. Luby, and R. Rubinfeld Self-testing/correcting with applications to numerical problems J. Comput. System Sci. 47 3 1993 549 595
11. H. Chen, A. Frieze, Coloring bipartite hypergraphs, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization, Proc. 5th Internat. IPCO Conf. Lecture Notes in Computer Science, Springer, Berlin, Vol. 1084, 1996, pp. 345-358.
12. A. Czumaj, and C. Scheideler An algorithmic approach to the general Lovász Local Lemma with applications to scheduling and satisfiability problems Proc. 32nd Ann. ACM Symp. on Theory of Computing (STOC) 2000 ACM Press New York 38 47
13. A. Czumaj, and C. Scheideler Coloring non-uniform hypergraphs A new algorithmic approach to the general Lovász Local Lemma Random Struct. Algorithms 17 3-4 2000 213 237
14. A. Czumaj, and C. Sohler Abstract combinatorial programs and efficient property testers Proc. 43rd IEEE Symp. on Foundations of Computer Science (FOCS) 2000 IEEE Computer Society Press Los Alamitos 83 92
15. A. Czumaj, C. Sohler, M. Ziegler, Property testing in computational geometry, in: M. Paterson (Ed.), Algorithms - ESA '2000, Proc. 8th Ann. European Symp., Lecture Notes in Computer Science, Springer, Berlin, Vol. 1879, pp. 155-166, 2000.
16. P. Erdos, L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in: A. Hajnal, R. Rado, V.T. Sós (Eds.), Infinite and Finite Sets (to Paul Erdos on his 60th birthday), Vol. II, North-Holland, Amsterdam, 1975, pp. 609-627.
17. F. Ergün, S. Kannan, S.R. Kumar, R. Rubinfeld, and M. Viswanathan Spot-checkers J. Comput. System Sci. 60 2000 717 751
18. F. Ergün, S.R. Kumar, and R. Rubinfeld Approximate checking of polynomials and functional equations Proc. 37th IEEE Symp. on Foundations of Computer Science (FOCS) 1996 IEEE Computer Society Press Los Alamitos 592 601
19. E. Fischer Testing graphs for colorability properties Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 2001 SIAM Philadelphia 873 882
20. E. Fischer, and I. Newman Testing of matrix properties Proc. 33rd Ann. ACM Symp. on Theory of Computing (STOC) 2001 ACM Press New York 286 295
21. A. Frieze, and R. Kannan Quick approximation to matrices and applications Combinatorica 19 1999 175 220
22. O. Goldreich, Combinatorial property testing (a survey), in: P. Pardalos, S. Rajasekaran, J. Rolim (Eds.), Proc. of the DIMACS Workshop on Randomization Methods in Algorithm Design, DIMACS, Series in Discrete Mathematics and Theoretical Computer Science, Vol. 43, American Mathematical Society, Providence, RI, 1999, pp. 45-59.
23. O. Goldreich, and D. Ron A sublinear bipartiteness tester for bounded degree graphs Combinatorica 19 3 1999 335 373
24. O. Goldreich, S. Goldwasser, and D. Ron Property testing and its connection to learning and approximation J. ACM 45 4 1998 653 750
25. V. Guruswami, J. Håstad, and M. Sudan Hardness of approximate hypergraph coloring Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS) 2000 IEEE Computer Society Press Los Alamitos 149 158
26. M. Krivelevich, R. Nathaniel, and B. Sudakov Approximating coloring and maximum independent sets in 3-uniform hypergraphs Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) 2001 327 328
27. M. Krivelevich, B. Sudakov, Approximate coloring of uniform hypergraphs, in: G. Bilardi, G.F. Italiano, A. Pietracaprina, G. Pucci (Eds.), Algorithms - ESA '98, Proc. 6th Ann. European Symp., Lecture Notes in Computer Science, Springer, Berlin, Vol. 1461, 1998, pp. 477-489.
28. L. Lovász Coverings and colorings of hypergraphs Proc. 4th Southeastern Conf. on Combinatorics, Graph, Theory and Computing 1973 Utilitas Mathematica Publishing Winnipeg 3 12
29. C.-J. Lu, Deterministic hypergraph coloring and its applications, in: M. Luby, J. Rolim, M. Serna (Eds.), Randomization and Approximation Techniques in Computer Science, Proc. 2nd Internat. Workshop RANDOM'98, Lecture Notes in Computer Science, Springer, Berlin, Vol. 1518, 1998, pp. 35-46.
30. M. Parnas, and D. Ron Testing metric properties Proc. 33rd Ann. ACM Symp. on Theory of Computing (STOC) 2001 ACM Press New York 276 285
31. J. Radhakrishnan, and A. Srinivasan Improved bounds and algorithms for hypergraph two-coloring Proc. 39th IEEE Symp. on Foundations of Computer Science (FOCS) 1998 IEEE Computer Society Press Los Alamitos 684 693
32. V. Rödl, and R.A. Duke On graphs with small subgraphs of large chromatic number Graphs Combin. 1 1985 91 96
33. D. Ron Property testing P.M. Pardalos S. Rajasekaran J. Reif J.D.P. Rolim Handbook of Randomized Algorithms 2001 Kluwer Academic Publishers 597 650
34. R. Rubinfeld Robust functional equations and their applications to program testing Proc. 35th IEEE Symp. on Foundations of Computer Science (FOCS) 1994 IEEE Computer Society Press Silver Spring, MD 288 299
35. R. Rubinfeld, and M. Sudan Robust characterization of polynomials with applications to program testing SIAM J. Comput. 25 2 1996 252 271