On the query complexity of testing orientations for being Eulerian
Fischer, E. and Lachish, Oded and Matsliah, A. and Newman, I. and Yahalom, O. (2012) On the query complexity of testing orientations for being Eulerian. ACM Transactions on Algorithms 8 (2), pp. 1-41. ISSN 1549-6325.
Abstract
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | School of Business, Economics & Informatics > Computer Science and Information Systems |
| Depositing User: | Sarah Hall |
| Date Deposited: | 30 May 2013 13:12 |
| Last Modified: | 11 Oct 2016 12:01 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7105 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |