TY - GEN
T1 - On the query complexity of testing orientations for being Eulerian
AU - Fischer, Eldar
AU - Lachish, Oded
AU - Newman, Ilan
AU - Matsliah, Arie
AU - Yahalom, Orly
PY - 2008
Y1 - 2008
N2 - We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a non-constant 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 sub-linear 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.
AB - We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a non-constant 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 sub-linear 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.
UR - http://www.scopus.com/inward/record.url?scp=52049123839&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85363-3_32
DO - 10.1007/978-3-540-85363-3_32
M3 - Conference contribution
AN - SCOPUS:52049123839
SN - 3540853626
SN - 9783540853626
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 402
EP - 415
BT - Approximation, Randomization and Combinatorial Optimization
T2 - 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and 12th International Workshop on Randomization and Computation, RANDOM 2008
Y2 - 25 August 2008 through 27 August 2008
ER -