On the query complexity of testing orientations for being Eulerian

We consider testing directed graphs Eulerianity in the orientation model introduced in Halevy et al. [2005]. Despite the local nature of the Eulerian property, it turns out to be significantly harder to test than other properties studied in the orientation model. We show a nonconstant lower bound on the query complexity of 2-sided tests and a linear lower bound on the query complexity of 1-sided tests for this property. On the positive side, we give several 1-sided and 2-sided tests, including a sublinear query complexity 2-sided test, for general graphs. For special classes of graphs, including bounded-degree graphs and expander graphs, we provide improved results. In particular, we give a 2-sided test with constant query complexity for dense graphs, as well as for expander graphs with a constant expansion parameter.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[2]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[3]  H. Fleischner.  Eulerian graphs and related topics , 1990 .

[4]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

[5]  Ilan Newman.  Testing Membership in Languages that Have Small Width Branching Programs , 2002, SIAM J. Comput..

[6]  Gheorghe Paun,et al.  Current Trends in Theoretical Computer Science: The Challenge of the New Century , 2004 .

[7]  Dekel Tsur,et al.  Testing Orientation Properties , 2005, Electron. Colloquium Comput. Complex..

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  P. Pevzner,et al.  An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Eldar Fischer,et al.  Testing st -Connectivity , 2007, APPROX-RANDOM.

[11]  László Babai,et al.  On the diameter of Eulerian orientations of graphs , 2006, SODA '06.

[12]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

[13]  Toshihide Ibaraki,et al.  A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations , 1998, Comb..

[14]  W. T. Tutte.  Graph Theory , 1984 .

[15]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[16]  Peter Winkler,et al.  Counting Eulerian Circuits is #P-Complete , 2005, ALENEX/ANALCO.

[17]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[18]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2004, J. Comput. Syst. Sci..

[19]  Eldar Fischer,et al.  On the Query Complexity of Testing Orientations for Being Eulerian , 2008, APPROX-RANDOM.

[20]  Eldar Fischer,et al.  Testing Convexity Properties of Tree Colorings , 2007, Algorithmica.

[21]  Dekel Tsur,et al.  Testing Properties of Constraint-Graphs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[22]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[23]  Ilan Newman.  Testing of function that have small width branching programs , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[24]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[25]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.

[26]  Peter Winkler,et al.  On the number of Eulerian orientations of a graph , 2005, Algorithmica.

[27]  Michael A. Bender,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002, Random Struct. Algorithms.

[28]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[29]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2003, STOC '03.

[30]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

[31]  GoldreichOded,et al.  Property testing and its connection to learning and approximation , 1998 .