Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom. On the Query Complexity of Testing Orientations for Being Eulerian. In Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings. Volume 5171 of Lecture Notes in Computer Science, pages 402-415, Springer, 2008. [doi]
@inproceedings{FischerLNMY08,
title = {On the Query Complexity of Testing Orientations for Being Eulerian},
author = {Eldar Fischer and Oded Lachish and Ilan Newman and Arie Matsliah and Orly Yahalom},
year = {2008},
doi = {10.1007/978-3-540-85363-3_32},
url = {http://dx.doi.org/10.1007/978-3-540-85363-3_32},
tags = {testing},
researchr = {https://researchr.org/publication/FischerLNMY08},
cites = {0},
citedby = {0},
pages = {402-415},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings},
editor = {Ashish Goel and Klaus Jansen and José D. P. Rolim and Ronitt Rubinfeld},
volume = {5171},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-85362-6},
}